Hypothesis: HR 30:
Ordering Principle: Every set can be linearly ordered.
Conclusion: HR 15:
\(KW(\infty,\infty)\) (KW), The Kinna-Wagner Selection Principle: For every set \(M\) there is a function \(f\) such that for all \(A\in M\), if \(|A|>1\) then \(\emptyset\neq f(A)\subsetneq A\). (See Form 81(\(n\)).
List of models where hypothesis is true and the conclusion is false:
| Name | Statement |
|---|---|
| \(\cal M29\) Pincus' Model II | Pincus constructs a generic extension \(M[I]\) of a model \(M\) of \(ZF +\) class choice \(+ GCH\) in which \(I=\bigcup_{n\in\omega}I_n\), \(I_{-1}=2\) and \(I_{n+1}\) is a denumerable set of independent functions from \(\omega\) onto \(I_n\) |
| \(\cal M44\) Pincus' Model VI | This is the model of <a href="/articles/Pincus-1977a">Pincus [1977a]</a>, Theorem 2.1 \((B)\) |
| \(\cal N3\) Mostowski's Linearly Ordered Model | \(A\) is countably infinite;\(\precsim\) is a dense linear ordering on \(A\) without first or lastelements (\((A,\precsim) \cong (\Bbb Q,\le)\)); \(\cal G\) is the group of allorder automorphisms on \((A,\precsim)\); and \(S\) is the set of all finitesubsets of \(A\) |
| \(\cal N5\) The Mathias/Pincus Model II (an extension of \(\cal N4\)) | \(A\) iscountably infinite; \(\precsim\) and \(\le\) are universal homogeneous partialand linear orderings, respectively, on \(A\), (See <a href="/articles/Jech-1973b">Jech [1973b]</a>p101 for definitions.); \(\cal G\) is the group of all order automorphismson \((A,\precsim,\le)\); and \(S\) is the set of all finite subsets of \(A\) |
| \(\cal N19(\precsim)\) Tsukada's Model | Let \((P,\precsim)\) be a partiallyordered set that is not well ordered; Let \(Q\) be a countably infinite set,disjoint from \(P\); and let \(I=P\cup Q\) |
| \(\cal N29\) Dawson/Howard Model | Let \(A=\bigcup\{B_n; n\in\omega\}\) is a disjoint union, where each \(B_n\) is denumerable and ordered like the rationals by \(\le_n\) |
| \(\cal N38\) Howard/Rubin Model I | Let \((A,\le)\) be an ordered set of atomswhich is order isomorphic to \({\Bbb Q}^\omega\), the set of all functionsfrom \(\omega\) into \(\Bbb Q\) ordered by the lexicographic ordering |
| \(\cal N40\) Howard/Rubin Model II | A variation of \(\cal N38\) |
| \(\cal N48\) Pincus' Model XI | \(\cal A=(A,<,C_0,C_1,\dots)\) is called an<em>ordered colored set</em> (OC set) if \(<\) is a linear ordering on \(A\)and the \(C_i\), for \(i\in\omega\) are subsets of \(A\) such that for each\(a\in A\) there is exactly one \(n\in\omega\) such that \(a\in C_n\) |
| \(\cal N52\) Felgner/Truss Model | Let \((\cal B,\prec)\) be a countableuniversal homogeneous linearly ordered Boolean algebra, (i.e., \(<\) is alinear ordering extending the Boolean partial ordering on \(B\)) |
Code: 3
Comments: