Cohen \(\cal M44\): Pincus' Model VI | Back to this models page

Description: This is the model of Pincus [1977a], Theorem 2.1 \((B)\)

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
30

Ordering Principle: Every set can be linearly ordered.

43

\(DC(\omega)\) (DC), Principle of Dependent Choices: If \(S\)  is  a relation on a non-empty set \(A\) and \((\forall x\in A) (\exists y\in A)(x S y)\)  then there is a sequence \(a(0), a(1), a(2), \ldots\) of elements of \(A\) such that \((\forall n\in\omega)(a(n)\mathrel S a(n+1))\).  See Tarski [1948], p 96, Levy [1964], p. 136.

214

\(Z(\omega)\): For every family \(A\) of infinite sets, there is a function \(f\) such that for all \(y\in A\), \(f(y)\) is a non-empty subset of \(y\) and \(|f(y)|=\aleph_{0}\).

295

DO:  Every infinite set has a dense linear ordering.

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\)).  

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).

91

\(PW\):  The power set of a well ordered set can be well ordered.

118

Every linearly orderable topological space is normal.  Birkhoff [1967], p 241.

133  

Every set is either well orderable or has an infinite amorphous subset.

151

\(UT(WO,\aleph_{0},WO)\) (\(U_{\aleph_{1}}\)): The union of a well ordered set of denumerable sets is well  orderable. (If \(\kappa\) is a well ordered cardinal, see note 27 for \(UT(WO,\kappa,WO)\).)

163

Every non-well-orderable set has an infinite, Dedekind finite subset.

328

\(MC(WO,\infty)\): For  every well ordered set \(X\) such that for all \(x\in X\), \(|x|\ge 1\), there is a function \(f\) such that and for every \(x\in X\), \(f(x)\) is a finite, non-empty subset of \(x\). (See Form 67.)

329

\(MC(\infty,WO)\): For  every set \(M\) of well orderable sets such that for all \(x\in X\), \(|x|\ge 1\), there is a function \(f\) such that for every \(x\in X\), \(f(x)\) is a finite, non-empty subset of \(x\).  (See Form 67.)

Historical background: (B). It uses Pincus' general method foradding dependent choice (43). Beginning with a model \(\cal M\) of ZF +``The class form of choice'', Pincus adds three generic \(\omega_1\)sequences: \(\langle I_\alpha : \alpha < \omega_1 \rangle\), \(\langleA_\alpha : \alpha < \omega_1 \rangle\) and \(\langle \frak A_\alpha : \alpha< \omega_1 \rangle\). The sets \(I_\alpha\), \(\alpha < \omega_1\) areobtained as in \(\cal M1(\langle\omega_1\rangle)\), \(A_\alpha\) is a genericset of disjoint subsets of \(I_\alpha\) and \(\frak A_\alpha\) is agenerically added universal homogeneous structure for the theory denselinear orderings without first or last element (that is, \(\frak A_\alpha\)is a copy of the rationals with the usual ordering) with domain\(A_\alpha\). (See Pincus [1977a] for definitions.) InPincus [1977a], it is shown that in \(\cal M44\) the OrderingPrinciple (30) is true, \(f\) with domain \(A\) such that \(\forall x\in A\),\(f(x)\subseteq x\) and \(|f(x)| = \aleph_0\).'' (214) is true but theKinna-Wagner Principle (15) is false.Form 43 impliesForm 296 (Everyinfinite set is the disjoint union of infinitely many infinite sets.) andit is shown in Pincus [1997] that 30 + 296 implies 295 (Everyinfinite set has a dense linear ordering.) Thus,Form 295 is true.

Back