Fraenkel \(\cal N24(n,LO)\): Truss' Model III | Back to this models page
Description: This is a variation of \(\cal N24(n)\)in which the set \(B\) is linearly ordered
When the book was first being written, only the following form classes were known to be true in this model:
| Form Howard-Rubin Number | Statement |
|---|---|
| 6 | \(UT(\aleph_0,\aleph_0,\aleph_0,\Bbb R)\): The union of a denumerable family of denumerable subsets of \({\Bbb R}\) is denumerable. |
| 37 | Lebesgue measure is countably additive. |
| 91 | \(PW\): The power set of a well ordered set can be well ordered. |
| 122 | \(C(WO,<\aleph_{0})\): Every well ordered set of non-empty finite sets has a choice function. |
| 130 | \({\cal P}(\Bbb R)\) is well orderable. |
| 191 | \(SVC\): There is a set \(S\) such that for every set \(a\), there is an ordinal \(\alpha\) and a function from \(S\times\alpha\) onto \(a\). |
| 273 | There is a subset of \({\Bbb R}\) which is not Borel. |
| 305 | There are \(2^{\aleph_0}\) Vitali equivalence classes. (Vitali equivalence classes are equivalence classes of the real numbers under the relation \(x\equiv y\leftrightarrow(\exists q\in{\Bbb Q})(x-y=q)\).). \ac{Kanovei} \cite{1991}. |
| 309 | The Banach-Tarski Paradox: There are three finite partitions \(\{P_1,\ldots\), \(P_n\}\), \(\{Q_1,\ldots,Q_r\}\) and \(\{S_1,\ldots,S_n, T_1,\ldots,T_r\}\) of \(B^3 = \{x\in {\Bbb R}^3 : |x| \le 1\}\) such that \(P_i\) is congruent to \(S_i\) for \(1\le i\le n\) and \(Q_i\) is congruent to \(T_i\) for \(1\le i\le r\). |
| 313 | \(\Bbb Z\) (the set of integers under addition) is amenable. (\(G\) is {\it amenable} if there is a finitely additive measure \(\mu\) on \(\cal P(G)\) such that \(\mu(G) = 1\) and \(\forall A\subseteq G, \forall g\in G\), \(\mu(gA)=\mu(A)\).) |
| 361 | In \(\Bbb R\), the union of a denumerable number of analytic sets is analytic. G. Moore [1982], pp 181 and 325. |
| 363 | There are exactly \(2^{\aleph_0}\) Borel sets in \(\Bbb R\). G. Moore [1982], p 325. |
| 368 | The set of all denumerable subsets of \(\Bbb R\) has power \(2^{\aleph_0}\). |
| 369 | If \(\Bbb R\) is partitioned into two sets, at least one of them has cardinality \(2^{\aleph_0}\). |
When the book was first being written, only the following form classes were known to be false in this model:
| Form Howard-Rubin Number | Statement |
|---|---|
| 33-n | If \(n\in\omega-\{0,1\}\), \(C(LO,n)\): Every linearly ordered set of \(n\) element sets has a choice function. |
| 67 | \(MC(\infty,\infty)\) \((MC)\), The Axiom of Multiple Choice: For every set \(M\) of non-empty sets there is a function \(f\) such that \((\forall x\in M)(\emptyset\neq f(x)\subseteq x\) and \(f(x)\) is finite). |
| 192 | \(EP\) sets: For every set \(A\) there is a projective set \(X\) and a function from \(X\) onto \(A\). |
| 344 | If \((E_i)_{i\in I}\) is a family of non-empty sets, then there is a family \((U_i)_{i\in I}\) such that \(\forall i\in I\), \(U_i\) is an ultrafilter on \(E_i\). |
Historical background: Suppose that \(n>1\) and let\(A=\{a_{qi}: q\in\Bbb Q, i\in n\}\). For each \(q\in\Bbb Q\), let\(b_q=\{a_{qi}: i\in n\}\) and let \(B=\{b_q: q\in\Bbb Q\}\). We define alinear ordering, \(\precsim\), on \(B\) so that for all \(p,q\in\Bbb Q\),\(b_p\precsim b_q\) iff \(p\le q\). \(\cal G\) is the group of all permutationson \(A\) which are order automorphisms on \((B,\precsim)\) and \(S\) is the setof all finite subsets of \(A\). In this model \(B\) is a linearly ordered setof \(n\)-element sets that does not have a choice function (33(\(n\)) isfalse). However, every well ordered set of finite sets has a choicefunction (122 is true). Since 122 + 67 (MC) implies AC (see [67 B]), itfollows that MC is false.
Back