arXiv (All)
open access
On canonicity of almost linear minimal orders
We prove that if a minimal ordered structure $(M, <, \ldots)$ 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 $<$-definab
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An Application of a Two-Sorted First-Order Language#113097
- Vague Mereology and Borderline Connections#723783
- Beyond Sequence Order: Syntax-Informed Positional Embeddings for Transformers#432586
- Vopěnka's Principle without Choice: Preservation under Symmetric Extensions#974937
- Categorical forms of the rigid direct-system representation for finite local-unit-aligned totally ordered monoids#1034001
Record · ID 1131155
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive