This non-implication,
Form 386 \( \not \Rightarrow \)
Form 1,
whose code is 6,
is constructed around a proven non-implication as follows:
Note: This non-implication is actually a code 4, as this non-implication satisfies the
transferability criterion. Click
Transfer details for all the details)
Hypothesis | Statement |
---|---|
Form 14 | <p> <strong>BPI:</strong> Every Boolean algebra has a prime ideal. </p> |
Conclusion | Statement |
---|---|
Form 97 | <p> <strong>Cardinal Representatives:</strong> For every set \(A\) there is a function \(c\) with domain \({\cal P}(A)\) such that for all \(x, y\in {\cal P}(A)\), (i) \(c(x) = c(y) \leftrightarrow x\approx y\) and (ii) \(c(x)\approx x\). <a href="/books/8">Jech [1973b]</a> p 154. </p> |
The conclusion Form 386 \( \not \Rightarrow \) Form 1 then follows.
Finally, the
List of models where hypothesis is true and the conclusion is false:
Name | Statement |
---|---|
\(\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\) |