Implications

This non-implication, Form 227 \( \not \Rightarrow \) Form 259, 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)

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 1349, whose string of implications is:
    317 \(\Rightarrow\) 14 \(\Rightarrow\) 227
  • A proven non-implication whose code is 5. In this case, it's Code 3: 618, Form 317 \( \not \Rightarrow \) Form 51 whose summary information is:
    Hypothesis Statement
    Form 317 <p> <strong>Weak Sikorski Theorem:</strong>  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\).

    Conclusion Statement
    Form 51 <p> <strong>Cofinality Principle:</strong> Every linear ordering has a cofinal sub well ordering.  <a href="/articles/Sierpi\'nski-1918">Sierpi\'nski [1918]</a>, p 117. </p>

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 9714, whose string of implications is:
    259 \(\Rightarrow\) 51

The conclusion Form 227 \( \not \Rightarrow \) Form 259 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\)
\(\cal N19(\precsim)\) Tsukada's Model Let \((P,\precsim)\) be a partiallyordered set that is not well ordered; Let \(Q\) be a countably infinite set,disjoint from \(P\); and let \(I=P\cup Q\)
\(\cal N29\) Dawson/Howard Model 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\)
\(\cal N38\) Howard/Rubin Model I Let \((A,\le)\) be an ordered set of atomswhich is order isomorphic to \({\Bbb Q}^\omega\), the set of all functionsfrom \(\omega\) into \(\Bbb Q\) ordered by the lexicographic ordering
\(\cal N40\) Howard/Rubin Model II A variation of \(\cal N38\)
\(\cal N48\) Pincus' Model XI \(\cal A=(A,<,C_0,C_1,\dots)\) is called an<em>ordered colored set</em> (OC set) if \(<\) is a linear ordering on \(A\)and the \(C_i\), for \(i\in\omega\) are subsets of \(A\) such that for each\(a\in A\) there is exactly one \(n\in\omega\) such that \(a\in C_n\)

Edit | Back