The dense linear ordering principle
The author investigates the relative strength of the following choice principles: AC (well-ordering theorem), OT (linear ordering theorem), BPI (Boolean prime ideal theorem), KW (Kinna-Wagner ordering principle), and the dense linear ordering principle DO (each set carries a dense linear ordering): Both in ZF and ZF+BPI, DO is strictly between OT and KW. OT is equivalent to the assertion that each infinite set has a cofinite subset which admits a dense linear ordering (Theorem 2). \textit{C. G. Gonzalez} [Fundam. Math. 147, 11-25 (1995; Zbl 0821.03024)] has shown that BPI (and therefore OT) does not imply DO. He proposed partition principles to study the gap between OT and DO, such as Part (each infinite set admits an infinite partition into infinite equivalence classes). Part follows (Corollary 1.2) both from KW and DC (and principle of dependent choices), and DO follows from OT+Part (Theorem 1A), whence KW implies DO. Concerning the converse, \textit{P. Howard} and \textit{J. E. Rubin} [Math. Log. Q. 42, 410-420 (1996; Zbl 0855.03028)] have shown that BPI+DC (and therefore DO) do not imply KW. The main result of the present paper is an alternative independence proof by means of a permutation model whose set of atoms is an \(\omega\)-saturated ordered colored set.
- The linear ordering problem revisited
- A recursion principle for linear orderings
- A Generalization of Altman's Ordering Principle
- scientific article; zbMATH DE number 3882490
- scientific article; zbMATH DE number 2059781
- On interpretability of almost linear orderings
- Low linear orderings
- The linearity of the Mitchell order
- Linear orderings of low degree
This page was built for publication: The dense linear ordering principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358048)
