Hypothesis: HR 40:
\(C(WO,\infty)\): Every well orderable set of non-empty sets has a choice function. Moore, G. [1982], p 325.
Conclusion: HR 260:
\(Z(TR\&C,P)\): If \((X,R)\) is a transitive and connected relation in which every partially ordered subset has an upper bound, then \((X,R)\) has a maximal element.
List of models where hypothesis is true and the conclusion is false:
| Name | Statement |
|---|---|
| \(\cal N33\) Howard/H\.Rubin/J\.Rubin 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 boundedsubsets of \(A\) |
Code: 3
Comments: