Binary consistent choice on pairs and a generalization of Konig's infinity lemma
Many fundamental mathematical results fail in ZF, i.e., in Zermelo-Fraenkel set theory without the Axiom of Choice. This article surveys results — old and new — that specify how much “choice” is needed precisely to validate each of certain basic analytical and topological results.
Węglorz' models are models for set theory without the axiom of choice. Each one is determined by an atomic Boolean algebra. Here the algebraic properties of the Boolean algebra are compared to the set theoretic properties of the model.
In set theory without the axiom of choice (AC), we observe new relations of the following statements with weak choice principles. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is countable. If in a partially ordered set, all chains are finite and all antichains have size , then the set has size for any regular . Every partially ordered set without a maximal element has two disjoint cofinal sub sets – CS. Every partially ordered set...
We show that: (1) It is provable in ZF (i.e., Zermelo-Fraenkel set theory minus the Axiom of Choice AC) that every compact scattered T₂ topological space is zero-dimensional. (2) If every countable union of countable sets of reals is countable, then a countable compact T₂ space is scattered iff it is metrizable. (3) If the real line ℝ can be expressed as a well-ordered union of well-orderable sets, then every countable compact zero-dimensional T₂ space...
We investigate the role that weak forms of the axiom of choice play in countable Tychonoff products, as well as countable disjoint unions, of Loeb and selective metric spaces.
A definition of finiteness is a set-theoretical property of a set that, if the Axiom of Choice (AC) is assumed, is equivalent to stating that the set is finite; several such definitions have been studied over the years. In this article we introduce a framework for generating definitions of finiteness in a systematical way: basic definitions are obtained from properties of certain classes of binary relations, and further definitions are obtained from the basic ones by closing them under subsets...
We investigate the relative consistency and independence of statements which imply the existence of various kinds of dense orders, including dense linear orders. We study as well the relationship between these statements and others involving partition properties. Since we work in ZF (i.e. without the Axiom of Choice), we also analyze the role that some weaker forms of AC play in this context
We show that it is consistent with ZF that there is a dense-in-itself compact metric space which has the countable chain condition (ccc), but is neither separable nor second countable. It is also shown that has an open dense subspace which is not paracompact and that in ZF the Principle of Dependent Choice, DC, does not imply the disjoint union of metrizable spaces is normal.