Hypothesis: HR 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.
Conclusion: HR 267:
There is no infinite, free complete Boolean algebra.
List of models where hypothesis is true and the conclusion is false:
| Name | Statement |
|---|---|
| \(\cal N1\) The Basic Fraenkel Model | The set of atoms, \(A\) is denumerable; \(\cal G\) is the group of all permutations on \(A\); and \(S\) isthe set of all finite subsets of \(A\) |
Code: 5
Comments: