We establish that the statement “For every infinite set X, every almost disjoint family in X can be extended to a maximal almost disjoint (MAD) family in X” is not provable in ZF + Boolean prime ideal theorem + Axiom of Countable Choice. This settles an open problem from Tachtsis [On the existence of almost disjoint and MAD families without AC, Bull. Polish Acad. Sci. Math. 67 (2019), 101–124].
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
(i) The statement P(ω)=“every partition of R has size ≤|R|” is equivalent to the proposition R(ω)=“for every subspace Y of the Tychonoff product 2P(ω) the restriction B|Y={Y∩B:B∈B} of the standard clopen base B of 2P(ω) to Y has size ≤|P(ω)|”. (ii) In ZF, P(ω) does not imply “every partition of P(ω) has a choice set”. (iii) Under P(ω) the following two statements are equivalent: (a) For every Boolean algebra of size ≤|R| every filter can be extended to an ultrafilter. (b) Every Boolean algebra of size ≤|R| has an ultrafilter.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In ZF, i.e., the Zermelo–Fraenkel set theory minus the Axiom of Choice AC, we investigate the relationship between the Tychonoff product 2P(X), where 2 is 2 = f0; 1g with the discrete topology, and the Stone space S(X) of the Boolean algebra of all subsets of X, where X =ω,R. We also study the possible placement of well-known topological statements which concern the cited spaces in the hierarchy of weak choice principles.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.