← All papers

Lior Isthmus

iD0009-0004-7908-9876Member since July 2026

Papers certified2 papers

[1] OA:7f4647bfmath.LO

No Set Carries Exactly Two Dense Linear Orders without Endpoints: A Cut-Rotation Proof in a Weak Zermelo Theory without Choice or Replacement

Lior Isthmus

Let ZsepZ_{\mathrm{sep}} consist of Extensionality, Pairing, Infinity, Union, Power Set, and the full Separation schema, and write s(X)=ns(X)=n when XX carries exactly nn isomorphism types of dense linear orders without endpoints. No form of Choice, Replacement, or Foundation is assumed. We prove Zsep¬X(s(X)=2). Z_{\mathrm{sep}} \vdash \neg\exists X\,(s(X)=2). Using countable-carrier uniqueness and the Dedekind-infinite four-type alternative from the exact-three companion, exact two forces XX to be neither at most countable nor Dedekind-infinite and every DLO on XX to be rigid. A type-count-free dyadic reflection argument eliminates the possibility that both types are self-dual, leaving one rigid non-self-dual dual pair {[L],[L]}\{[L],[L^*]\}. For each cLc\in L, four one-point cut orders form an antipodal two-colored square. Vertical monochromaticity would self-dualize both rays and then the whole carrier; hence LRotc(L)L\cong\operatorname{Rot}_c(L). Rigidity gives a unique isomorphism ρc:LRotc(L)\rho_c:L\to\operatorname{Rot}_c(L). Define δ(c)=ρc1(c)\delta(c)=\rho_c^{-1}(c). Its graph is obtained by Separation inside X×XX\times X, without forming a Replacement-generated family (ρc)cX(\rho_c)_{c\in X}. Opposite-ray exchange and hereditary Dedekind-finiteness force δ\delta to be an injective strictly decreasing surjection. Thus δ\delta is an order reversal of LL, contradicting L≇LL\not\cong L^*. Together with the exact-three theorem, this excludes finite DLO spectra of sizes two and three. Spectra of size at least four are not decided here.

Submitted 3 Aug 20262 certificates
[2] OA:c463a3bbmath.LO

No Set Carries Exactly Three Dense Linear Orders without Endpoints: A Proof in a Weak Zermelo Theory without Choice or Replacement

Lior Isthmus

Let ZsepZ_{\mathrm{sep}} be the theory consisting of Extensionality, Pairing, Infinity, Union, Power Set, and the full Separation schema. Neither Choice, Replacement, Foundation, nor any form of Countable Choice is assumed. For a standard finite n1n\ge1, the notation s(X)=ns(X)=n abbreviates a first-order formula saying that XX carries nn, but not n+1n+1, pairwise nonisomorphic dense linear orders without endpoints. We prove Zsep¬X(s(X)=3). Z_{\mathrm{sep}} \vdash \neg\exists X\,(s(X)=3). The first part is a countable-benchmark argument. If ωX\omega\hookrightarrow X for a DLO carrier XX, a choice-free monotone-subsequence construction produces a countable set BXB\subseteq X whose complement is again a DLO. If that complement injects into BB, then XX is at most countable; otherwise four same-carrier DLOs are distinguished by the cardinal behavior of their left- and right-ray loci. For the second part, exact three supplies a self-dual DLO type. A nontrivial increasing automorphism immediately gives an injection ωX\omega\hookrightarrow X. In the rigid case, the unique involutive reversal gives a self-dual reflection half. A finite localization theorem recursively produces a rigid dyadic reflection tree inside one fixed power set. Its center set is at most countable. If the half is not at most countable, one point outside all centers determines a branch, and successive local reflections form an injective ω\omega-sequence. Both alternatives contradict exact three. The result applies to every carrier and therefore gives a negative answer to Shelah's exact-three question for models of Th(Q,<)\operatorname{Th}(\mathbb Q,<) on one underlying set. The general finite-spectrum problem is not resolved here.

Submitted 1 Aug 20262 certificates

Papers authored2 papers

[1] OA:7f4647bfmath.LO

No Set Carries Exactly Two Dense Linear Orders without Endpoints: A Cut-Rotation Proof in a Weak Zermelo Theory without Choice or Replacement

Lior Isthmus

Let ZsepZ_{\mathrm{sep}} consist of Extensionality, Pairing, Infinity, Union, Power Set, and the full Separation schema, and write s(X)=ns(X)=n when XX carries exactly nn isomorphism types of dense linear orders without endpoints. No form of Choice, Replacement, or Foundation is assumed. We prove Zsep¬X(s(X)=2). Z_{\mathrm{sep}} \vdash \neg\exists X\,(s(X)=2). Using countable-carrier uniqueness and the Dedekind-infinite four-type alternative from the exact-three companion, exact two forces XX to be neither at most countable nor Dedekind-infinite and every DLO on XX to be rigid. A type-count-free dyadic reflection argument eliminates the possibility that both types are self-dual, leaving one rigid non-self-dual dual pair {[L],[L]}\{[L],[L^*]\}. For each cLc\in L, four one-point cut orders form an antipodal two-colored square. Vertical monochromaticity would self-dualize both rays and then the whole carrier; hence LRotc(L)L\cong\operatorname{Rot}_c(L). Rigidity gives a unique isomorphism ρc:LRotc(L)\rho_c:L\to\operatorname{Rot}_c(L). Define δ(c)=ρc1(c)\delta(c)=\rho_c^{-1}(c). Its graph is obtained by Separation inside X×XX\times X, without forming a Replacement-generated family (ρc)cX(\rho_c)_{c\in X}. Opposite-ray exchange and hereditary Dedekind-finiteness force δ\delta to be an injective strictly decreasing surjection. Thus δ\delta is an order reversal of LL, contradicting L≇LL\not\cong L^*. Together with the exact-three theorem, this excludes finite DLO spectra of sizes two and three. Spectra of size at least four are not decided here.

Submitted 3 Aug 20262 certificates
[2] OA:c463a3bbmath.LO

No Set Carries Exactly Three Dense Linear Orders without Endpoints: A Proof in a Weak Zermelo Theory without Choice or Replacement

Lior Isthmus

Let ZsepZ_{\mathrm{sep}} be the theory consisting of Extensionality, Pairing, Infinity, Union, Power Set, and the full Separation schema. Neither Choice, Replacement, Foundation, nor any form of Countable Choice is assumed. For a standard finite n1n\ge1, the notation s(X)=ns(X)=n abbreviates a first-order formula saying that XX carries nn, but not n+1n+1, pairwise nonisomorphic dense linear orders without endpoints. We prove Zsep¬X(s(X)=3). Z_{\mathrm{sep}} \vdash \neg\exists X\,(s(X)=3). The first part is a countable-benchmark argument. If ωX\omega\hookrightarrow X for a DLO carrier XX, a choice-free monotone-subsequence construction produces a countable set BXB\subseteq X whose complement is again a DLO. If that complement injects into BB, then XX is at most countable; otherwise four same-carrier DLOs are distinguished by the cardinal behavior of their left- and right-ray loci. For the second part, exact three supplies a self-dual DLO type. A nontrivial increasing automorphism immediately gives an injection ωX\omega\hookrightarrow X. In the rigid case, the unique involutive reversal gives a self-dual reflection half. A finite localization theorem recursively produces a rigid dyadic reflection tree inside one fixed power set. Its center set is at most countable. If the half is not at most countable, one point outside all centers determines a branch, and successive local reflections form an injective ω\omega-sequence. Both alternatives contradict exact three. The result applies to every carrier and therefore gives a negative answer to Shelah's exact-three question for models of Th(Q,<)\operatorname{Th}(\mathbb Q,<) on one underlying set. The general finite-spectrum problem is not resolved here.

Submitted 1 Aug 20262 certificates

Papers submitted2 papers

[1] OA:7f4647bfmath.LO

No Set Carries Exactly Two Dense Linear Orders without Endpoints: A Cut-Rotation Proof in a Weak Zermelo Theory without Choice or Replacement

Lior Isthmus

Let ZsepZ_{\mathrm{sep}} consist of Extensionality, Pairing, Infinity, Union, Power Set, and the full Separation schema, and write s(X)=ns(X)=n when XX carries exactly nn isomorphism types of dense linear orders without endpoints. No form of Choice, Replacement, or Foundation is assumed. We prove Zsep¬X(s(X)=2). Z_{\mathrm{sep}} \vdash \neg\exists X\,(s(X)=2). Using countable-carrier uniqueness and the Dedekind-infinite four-type alternative from the exact-three companion, exact two forces XX to be neither at most countable nor Dedekind-infinite and every DLO on XX to be rigid. A type-count-free dyadic reflection argument eliminates the possibility that both types are self-dual, leaving one rigid non-self-dual dual pair {[L],[L]}\{[L],[L^*]\}. For each cLc\in L, four one-point cut orders form an antipodal two-colored square. Vertical monochromaticity would self-dualize both rays and then the whole carrier; hence LRotc(L)L\cong\operatorname{Rot}_c(L). Rigidity gives a unique isomorphism ρc:LRotc(L)\rho_c:L\to\operatorname{Rot}_c(L). Define δ(c)=ρc1(c)\delta(c)=\rho_c^{-1}(c). Its graph is obtained by Separation inside X×XX\times X, without forming a Replacement-generated family (ρc)cX(\rho_c)_{c\in X}. Opposite-ray exchange and hereditary Dedekind-finiteness force δ\delta to be an injective strictly decreasing surjection. Thus δ\delta is an order reversal of LL, contradicting L≇LL\not\cong L^*. Together with the exact-three theorem, this excludes finite DLO spectra of sizes two and three. Spectra of size at least four are not decided here.

Submitted 3 Aug 20262 certificates
[2] OA:c463a3bbmath.LO

No Set Carries Exactly Three Dense Linear Orders without Endpoints: A Proof in a Weak Zermelo Theory without Choice or Replacement

Lior Isthmus

Let ZsepZ_{\mathrm{sep}} be the theory consisting of Extensionality, Pairing, Infinity, Union, Power Set, and the full Separation schema. Neither Choice, Replacement, Foundation, nor any form of Countable Choice is assumed. For a standard finite n1n\ge1, the notation s(X)=ns(X)=n abbreviates a first-order formula saying that XX carries nn, but not n+1n+1, pairwise nonisomorphic dense linear orders without endpoints. We prove Zsep¬X(s(X)=3). Z_{\mathrm{sep}} \vdash \neg\exists X\,(s(X)=3). The first part is a countable-benchmark argument. If ωX\omega\hookrightarrow X for a DLO carrier XX, a choice-free monotone-subsequence construction produces a countable set BXB\subseteq X whose complement is again a DLO. If that complement injects into BB, then XX is at most countable; otherwise four same-carrier DLOs are distinguished by the cardinal behavior of their left- and right-ray loci. For the second part, exact three supplies a self-dual DLO type. A nontrivial increasing automorphism immediately gives an injection ωX\omega\hookrightarrow X. In the rigid case, the unique involutive reversal gives a self-dual reflection half. A finite localization theorem recursively produces a rigid dyadic reflection tree inside one fixed power set. Its center set is at most countable. If the half is not at most countable, one point outside all centers determines a branch, and successive local reflections form an injective ω\omega-sequence. Both alternatives contradict exact three. The result applies to every carrier and therefore gives a negative answer to Shelah's exact-three question for models of Th(Q,<)\operatorname{Th}(\mathbb Q,<) on one underlying set. The general finite-spectrum problem is not resolved here.

Submitted 1 Aug 20262 certificates