Fraenkel \(\cal N29\): Dawson/Howard Model | Back to this models page
Description: 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\)
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. |
14 | BPI: Every Boolean algebra has a prime ideal. |
16 | \(C(\aleph_{0},\le 2^{\aleph_{0}})\): Every denumerable collection of non-empty sets each with power \(\le 2^{\aleph_{0}}\) has a choice function. |
23 | \((\forall \alpha)(UT(\aleph_{\alpha},\aleph_{\alpha}, \aleph_{\alpha}))\): For every ordinal \(\alpha\), if \(A\) and every member of \(A\) has cardinality \(\aleph_{\alpha}\), then \(|\bigcup A| = \aleph _{\alpha }\). |
24 | \(C(\aleph_0,2^{(2^{\aleph_0})})\): Every denumerable collection of non-empty sets each with power \(2^{(2^{\aleph_{0}})}\) has a choice function. |
37 | Lebesgue measure is countably additive. |
60 |
\(C(\infty,WO)\): Every set of non-empty, well orderable sets has a choice function. |
91 | \(PW\): The power set of a well ordered set can be well ordered. |
130 | \({\cal P}(\Bbb R)\) is well orderable. |
165 | \(C(WO,WO)\): Every well ordered family of non-empty, well orderable sets has a choice function. |
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}. |
317 | Weak Sikorski Theorem: If \(B\) is a complete, well orderable Boolean algebra and \(f\) is a homomorphism of the Boolean algebra \(A'\) into \(B\) where \(A'\) is a subalgebra of the Boolean algebra \(A\), then \(f\) can be extended to a homomorphism of \(A\) into \(B\). |
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 |
---|---|
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\)). |
51 | Cofinality Principle: Every linear ordering has a cofinal sub well ordering. Sierpi\'nski [1918], p 117. |
118 | Every linearly orderable topological space is normal. Birkhoff [1967], p 241. |
126 | \(MC(\aleph_0,\infty)\), Countable axiom of multiple choice: For every denumerable set \(X\) of non-empty sets there is a function \(f\) such that for all \(y\in X\), \(f(y)\) is a non-empty finite subset of \(y\). |
131 | \(MC_\omega(\aleph_0,\infty)\): For every denumerable family \(X\) of pairwise disjoint non-empty sets, there is a function \(f\) such that for each \(x\in X\), f(x) is a non-empty countable subset of \(x\). |
133 | Every set is either well orderable or has an infinite amorphous subset. |
144 | Every set is almost well orderable. |
152 | \(D_{\aleph_{0}}\): Every non-well-orderable set is the union of a pairwise disjoint, well orderable family of denumerable sets. (See note 27 for \(D_{\kappa}\), \(\kappa\) a well ordered cardinal.) |
167 | \(PKW(\aleph_{0},\ge 2,\infty)\), Partial Kinna-Wagner Principle: For every denumerable family \(F\) such that for all \(x\in F\), \(|x|\ge 2\), there is an infinite subset \(H\subseteq F\) and a function \(f\) such that for all \(x\in H\), \(\emptyset\neq f(x) \subsetneq x\). |
200 | For all infinite \(x\), \(|2^{x}| = |x!|\). |
253 | \L o\'s' Theorem: If \(M=\langle A,R_j\rangle_{j\in J}\) is a relational system, \(X\) any set and \({\cal F}\) an ultrafilter in \({\cal P}(X)\), then \(M\) and \(M^{X}/{\cal F}\) are elementarily equivalent. |
291 | For all infinite \(x\), \(|x!|=|x^x|\). |
Historical background: Thus, for each \(n\in\omega\), \((B_n,\le_n)\cong (\BbbQ, \le)\). \(\cal G\) is the group of all permutations on \(A\) such that forall \(n\in\omega\), and all \(\phi\in\cal G\), \(\phi\) is an order automorphismof \((B_n,\le_n)\) and \(S\) is the set of all finite subsets of \(A\). InDawson/Howard it is shown that \(|A!| < |2^A|\), thusForm 200 ((\(\forallx)(|2^x|=|x!|)\)) is false. Also, since \(|2^A|\) is clearly \(\le |A^A|\),form 291 (\((\forall x)(|x!|=|x^x|)\)) is also false. In Note 136 we provethat BPI (14) is true. Thus, \(C(\infty,<\aleph_0)\) (62) is true.Howard [1973] proves that in every FM model 62 implies 60(\(C(\infty,WO)\)). However, the set \(\{B_n: n\in\omega\}\) is a denumerableset that has no multiple choice function (\(MC(\aleph_0,\infty)\) (126) isfalse) nor does it have an infinite subset with a Kinna-Wagner selectionfunction (\(PKW(\aleph_0,\ge 2,\infty)\) (167) is false). SinceForm 165(\(C(WO,WO)\)) is true, (60 implies 165) it follows from Note 2(8 and 9)that 16 and 24 are also true.
Back