Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 5 min ago
PreprintCC BY 4.0arXiv

On canonicity of almost linear minimal orders

Abstract

We prove that if a minimal ordered structure (M, <, …) with infinite chains in an arbitrary language extending the language of strict orders interprets (in some power Mn) the linear order (ω, <), then this fact can be witnessed for n=1 via the incomparability relation of an <-definable strict order R; that R is unique up to ``almost equality'', i.e., finite rearrangements of elements of M; and that R can be defined from < in a constructive way. We also show that several variants of the question whether a minimal ordered structure interprets an infinite linear order are all equivalent.

Related

  1. Divisibility Estimates for Gaussian Norms and Almost-Prime Orders of a CM Elliptic Curve
    SeungJu Lee
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. Almost One Bit Violation of Minimum-Output Rényi Entropy Additivity Simultaneously at All Orders
    Guocheng Zhen, Chengkai Zhu, Ranyiliu Chen +1
    arXivPreprintarXiv licenceFull textAnalysis & PDEsQuantum physics & quantum informationarXiv
  3. The Almost Finite--Purely Infinite Dichotomy for Minimal Amenable Ample Groupoids
    Gábor Elek, Ádám Timár
    arXivPreprintarXiv licenceFull textAnalysis & PDEsDynamical systemsarXiv
  4. Minimal time for heat observability on almost-Riemannian surfaces
    Vincent Boulard, Amaury Hayat, Emmanuel Trélat
    HALPreprintCC BY 4.0Full textAnalysis & PDEsGeometry & topologyHALarXiv
  5. Regularity theory for non-local almost minimal surfaces via Euler-Lagrange inequalities at small scales
    Serena Dipierro, Ovidiu Savin, Enrico Valdinoci +1
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
BibTeX
@misc{jagiella2026canonicity,
  title = {{On canonicity of almost linear minimal orders}},
  author = {Grzegorz Jagiella},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.36313},
  eprint = {2609.36313},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.36313},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - On canonicity of almost linear minimal orders
AU  - Grzegorz Jagiella
PY  - 2026
DA  - 2026/09/30
PB  - arXiv
DO  - 10.48550/arxiv.2609.36313
UR  - https://arxiv.org/abs/2609.36313
AB  - We prove that if a minimal ordered structure (M, <, …) with infinite chains in an arbitrary language extending the language of strict orders interprets (in some power M^n) the linear order (ω, <), then this fact can be witnessed for n=1 via the incomparability relation of an <-definable strict order R; that R is unique up to ``almost equality'', i.e., finite rearrangements of elements of M; and that R can be defined from < in a constructive way. We also show that several variants of the question whether a minimal ordered structure interprets an infinite linear order are all equivalent.
ER  -