Hypothesis: HR 130:

\({\cal P}(\Bbb R)\) is well orderable.

Conclusion: HR 99:

Rado's Selection Lemma: Let \(\{K(\lambda): \lambda \in\Lambda\}\) be a family  of finite subsets (of \(X\)) and suppose for each finite \(S\subseteq\Lambda\) there is a function \(\gamma(S): S \rightarrow X\) such that \((\forall\lambda\in S)(\gamma(S)(\lambda)\in K(\lambda))\).  Then there is an \(f: \Lambda\rightarrow X\) such that for every finite \(S\subseteq\Lambda\) there is a finite \(T\) such that \(S\subseteq T\subseteq\Lambda\) and such that \(f\) and \(\gamma (T)\) agree on S.

List of models where hypothesis is true and the conclusion is false:

Name Statement
\(\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 N7\) L\"auchli's Model I \(A\) is countably infinite
\(\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:


Edit | Back