Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 6

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  weak axioms of choice
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote On the existence of almost disjoint and MAD families without AC
EN
In set theory without the Axiom of Choice (AC), we investigate the deductive strength and mutual relationships of the following statements: 1) Every infinite set X has an almost disjoint family A of infinite subsets of X with [formula]. (2) Every infinite set X has an almost disjoint family A of infinite subsets of X with [formula]. (3) For every infinite set X, every almost disjoint family in X can be extended to a maximal almost disjoint family in X. (4) For every infinite set X, no infinite maximal almost disjoint family in X has cardinality [formula]. (5) For every infinite set A, there is a continuum sized almost disjoint family A ⊆ Aω. (6) For every free ultrafilter U on ω and every infinite set A, the ultrapower Aω/U has cardinality at least [formula].
2
Content available remote On BPI Restricted to Boolean Algebras of Size Continuum
EN
(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
Content available remote Remarks on the Stone Spaces of the Integers and the Reals without AC
EN
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.
4
Content available remote On the set-theoretic strength of countable compactness of the Tychonoff product 2R
EN
We work in ZF set theory (i.e., Zermelo-Fraenkel set theory minus the Axiom of Choice AC) and show the following: 1. The Axiom of Choice for well-ordered families of non-empty sets (ACWO) does not imply "the Tychonoff product 2R, where 2 is the discrete space {0,1}, is countably compact" in ZF. This answers in the negative the following question from Keremedis, Felouzis, and Tachtsis [Bull. Polish Acad. Sci. Math. 55 (2007)]: Does the Countable Axiom of Choice for families of non-empty sets of reals imply 2R is countably compact in ZF? 2. Assuming the Countable Axiom of Multiple Choice (CMC), the statements "every infinite subset of 2R has an accumulation point", "every countably infinite subset of 2R has an accumulation point", "2R is countably compact", and UF(ω) = "there is a free ultrafilter on ω" are pairwise equivalent. 3. The statements "for every infinite set X, every countably infinite subset of 2X has an accumulation point", "every countably infinite subset of 2R has an accumulation point", and UF(ω) are, in ZF, pairwise equivalent. Hence, in ZF, the statement "2R is countably compact "implies UF(ω). 4. The statement "every infinite subset of 2R has an accumulation point" implies "every countable family of 2-element subsets of the powerset Ρ(R) of R has a choice function". 5. The Countable Axiom of Choice restricted to non-empty finite sets, (CACfin), is, in ZF, strictly weaker than the statement "for every infinite set X, 2X is countably compact".
5
Content available remote On the compactness and countable compactness of 2R in ZF
EN
In the framework of ZF (Zermelo-Fraenkel set theory without the Axiom of Choice) we provide topological and Boolean-algebraic characterizations of the statements "2R is countably compact" and "2R is compact".
EN
Let X be an infinite set, and P(X) the Boolean algebra of subsets of X. We consider the following statements: BPI(X): Every proper filter of P(X) can be extended to an ultrafilter. UF(X): P(X) has a free ultrafilter. We will show in ZF (i.e., Zermelo–Fraenkel set theory without the Axiom of Choice) that the following four statements are equivalent: (i) BPI(ω). (ii) The Tychonoff product 2R, where 2 is the discrete space {0, 1}, is compact. (iii) The Tychonoff product [0, 1] R is compact. (iv) In a Boolean algebra of size ≤ |R| every filter can be extended to an ultrafilter. We will also show that in ZF, UF(R) does not imply BPI(R). Hence, BPI(R) is strictly stronger than UF(R). We do not know if UF(ω) implies BPI(ω) in ZF. Furthermore, we will prove that the axiom of choice for sets of subsets of R does not imply BPI(R) and, in addition, the axiom of choice for well orderable sets of non-empty sets does not imply BPI(ω).
first rewind previous Strona / 1 next fast forward last
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ć.