This is a continuation of . We study the Tychonoff Compactness Theorem for various definitions of compactness and for various types of spaces . We also study well ordered Tychonoff products and the effect that the multiple choice axiom has on such products.
Two theorems are proved: First that the statement“there exists a field F such that for every vector space over F, every generating set contains a basis”implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ℤ2 has a basis implies that every well-ordered collection of two-element sets has a choice function.
The Fraenkel-Mostowski method has been widely used to prove independence results among weak versions of the axiom of choice. In this paper it is shown that certain statements cannot be proved by this method. More specifically it is shown that in all Fraenkel-Mostowski models the following hold: 1. The axiom of choice for sets of finite sets implies the axiom of choice for sets of well-orderable sets. 2. The Boolean prime ideal theorem implies a weakened form of Sikorski's theorem.
We study statements about countable and well-ordered unions and their relation to each other and to countable and well-ordered forms of the axiom of choice. Using WO as an abbreviation for “well-orderable”, here are two typical results: The assertion that every WO family of countable sets has a WO union does not imply that every countable family of WO sets has a WO union; the axiom of choice for WO families of WO sets does not imply that the countable union (...) of countable sets is WO. (shrink)
We study properties of certain subclasses of the Dedekind finite sets in set theory without the axiom of choice with respect to the comparability of their elements and to the boundedness of such classes, and we answer related open problems from Herrlich’s “The Finite and the Infinite.” The main results are as follows: 1. It is relatively consistent with ZF that the class of all finite sets is not the only finiteness class such that any two of its elements are (...) comparable. 2. The principle “Small Violations of Choice” —introduced by A. Blass—implies that the class of all Dedekind finite sets is bounded above. 3. “The class of all Dedekind finite sets is bounded above” is true in every permutation model of ZFA in which the class of atoms is a set, and in every symmetric model of ZF. 4. There exists a model of ZFA set theory in which the class of all atoms is a proper class and in which the class of all infinite Dedekind finite sets is not bounded above. 5. There exists a model of ZF in which the class of all infinite Dedekind finite sets is not bounded above. (shrink)
We investigate the set theoretical strength of some properties of normality, including Urysohn's Lemma, Tietze-Urysohn Extension Theorem, normality of disjoint unions of normal spaces, and normality of Fσ subsets of normal spaces.
Let NBG be von Neumann-Bernays-Gödel set theory without the axiom of choice and let NBGA be the modification which allows atoms. In this paper we consider some of the well-known class or global forms of the wellordering theorem, the axiom of choice, and maximal principles which are known to be equivalent in NBG and show they are not equivalent in NBGA.
In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to “Every set has the same cardinal number as some transitive set”. In set theory without the axiom of choice, we study the deductive strength of this and similar statements introduced by von Rimscha.
Two Fraenkel-Mostowski models are constructed in which the Boolean Prime Ideal Theorem is true. In both models, AC for countable sets is true, but AC for sets of cardinality 2math image and the 2m = m principle are both false. The Principle of Dependent Choices is true in the first model, but false in the second.
We show that it is not possible to construct a Fraenkel-Mostowski model in which the axiom of choice for well-ordered families of sets and the axiom of choice for sets are both true, but the axiom of choice is false.
The deductive relationships between six statements are examined in set theory without the axiom of choice. Each of these statements follows from the axiom of choice and involves linear orderings in some way.
We show that the assertion that every vector space is a projective module implies the axiom of multiple choice and that the reverse implication does not hold in set theory weakened to permit the existence of atoms.
The deductive strengths of three variations of Rado's selection lemma are studied in set theory without the axiom of choice. Two are shown to be equivalent to Rado's lemma and the third to the Boolean prime ideal theorem. MSC: 03E25, 04A25, 06E05.