In this note we show that the Axiom of Countable Choice is equivalent to two statements from the theory of pseudometric spaces: the first of them is a well-known characterization of uniform continuity for functions between metric spaces, and the second declares that sequentially compact pseudometric spaces are \—meaning that all real valued, continuous functions defined on these spaces are necessarily uniformly continuous.

Under the axiom of choice, every first countable space is a Fréchet-Urysohn space. Although, in its absence even ℝ may fail to be a sequential space.Our goal in this paper is to discuss under which set-theoretic conditions some topological classes, such as the first countable spaces, the metric spaces, or the subspaces of ℝ, are classes of Fréchet-Urysohn or sequential spaces.In this context, it is seen that there are metric spaces which are not sequential spaces. This (...) fact raises the question of knowing if the completion of a metric space exists and it is unique. The answer depends on the definition of completion.Among other results it is shown that: every first countable space is a sequential space if and only if the axiom of countable choice holds, the sequential closure is idempotent in ℝ if and only if the axiom of countable choice holds for families of subsets of ℝ, and every metric space has a unique equation image-completion. (shrink)

We show that the Axiom of Countable Choice is necessary and sufficient to prove that the existence of a Borel measure on a pseudometric space such that the measure of open balls is positive and finite implies separability of the space. In this way a negative answer to an open problem formulated in Górka (Am Math Mon 128:84–86, 2020) is given. Moreover, we study existence of maximal $$\delta $$ δ -separated sets in metric and pseudometric spaces from (...) the point of view the Axiom of Choice and its weaker forms. (shrink)

It is easy to prove in ZF− that a relation R satisfies the maximal condition if and only if its transitive hull R* does; equivalently: R is well-founded if and only if R* is. We will show in the following that, if the maximal condition is replaced by the chain condition, as is often the case in Algebra, the resulting statement is not provable in ZF− anymore . More precisely, we will prove that this statement is equivalent in ZF− to (...) the countable axiom of choice ACω. Moreover, applying this result we will prove that the axiom of dependent choices, restricted to partial orders as used in Algebra, already implies the general form for arbitrary relations as formulated first by Teichmüller and, independently, some time later by Bernays and Tarski. (shrink)

We show that the Axiom of Dependent Choice,, holds in countably iterable, passive premice constructed over their reals which satisfy the Axiom of Determinacy,, in a background universe. This generalizes an argument of Kechris for using Steel's analysis of scales in mice. In particular, we show that for any and any countable set of reals A so that and, we have that.

Takeuti introduced an infinitary proof system for determinate logic and showed that for transitive models of Zermelo-Fraenkel set theory with the Axiom of Dependent Choice that contain all reals, the cut-elimination theorem is equivalent to the Axiom of Determinacy, and in particular contradicts the Axiom of Choice. We consider variants of Takeuti's theorem without assuming the failure of the Axiom of Choice. For instance, we show that if one removes atomic formulae of infinite (...) arity from the language of Takeuti's proof system, then cut elimination is equivalent to a determinacy hypothesis provable, e.g., in ZFC + “there are infinitely many Woodin cardinals.” A slight extension of the proof system admits cut elimination for countable sequents under the same assumptions. A simple modification of the proof system yields analogs of the results above for the Axiom of Real Determinacy and uncountably many Woodin cardinals. (shrink)

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)

In the realm of metric spaces the role of choice principles is investigated.

Should weak forms of the axiom of choice really be accepted within constructive mathematics? A critical view of the Brouwer-Heyting-Kolmogorov interpretation, accompanied by the intention to include nondeterministic algorithms, leads us to subscribe to Richman's appeal for dropping countable choice. As an alternative interpretation of intuitionistic logic, we propose to renew dialogue semantics.

We work in set-theory without choice ZF. A set is Countable if it is finite or equipotent with ${\Bbb N}$ . Given a closed subset F of [0, 1] I which is a bounded subset of $\ell ^{1}(I)$ (resp. such that $F\subseteq c_{0}(I)$ ), we show that the countable axiom of choice for finite sets, (resp. the countable axiom of choice AC N ) implies that F is compact. This enhances previous results (...) where AC N (resp. the axiom of Dependent Choices) was required. If I is linearly orderable (for example $I={\Bbb R}$ ), then, in ZF, the closed unit ball of the Hilbert space $\ell ^{2}(I)$ is (Loeb-)compact in the weak topology. However, the weak compactness of the closed unit ball of $\ell ^{2}(\scr{P}({\Bbb R}))$ is not provable in ZF. (shrink)

We present a possible computational content of the negative translation of classical analysis with the Axiom of (countable) Choice. Interestingly, this interpretation uses a refinement of the realizability semantics of the absurdity proposition, which is not interpreted as the empty type here. We also show how to compute witnesses from proofs in classical analysis of ∃-statements and how to extract algorithms from proofs of ∀∃-statements. Our interpretation seems computationally more direct than the one based on Godel's Dialectica (...) interpretation. (shrink)

We show that some well known theorems in topology may not be true without the axiom of choice.

It is shown that for compact metric spaces the following statements are pairwise equivalent: “X is Loeb”, “X is separable”, “X has a we ordered dense subset”, “X is second countable”, and “X has a dense set G = ∪{Gn : n ∈ ω}, ∣Gn∣ < ω, with limn→∞ diam = 0”. Further, it is shown that the statement: “Compact metric spaces are weakly Loeb” is not provable in ZF0 , the Zermelo-Fraenkel set theory without the axiom of (...) regularity, and that the countable axiom of choice for families of finite sets CACfin does not imply the statement “Compact metric spaces are separable”. (shrink)

This is a continuation of [2]. 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.

We study theorems from Functional Analysis with regard to their relationship with various weak choice principles and prove several results about them: “Every infinite‐dimensional Banach space has a well‐orderable Hamel basis” is equivalent to ; “ can be well‐ordered” implies “no infinite‐dimensional Banach space has a Hamel basis of cardinality ”, thus the latter statement is true in every Fraenkel‐Mostowski model of ; “No infinite‐dimensional Banach space has a Hamel basis of cardinality ” is not provable in ; “No (...) infinite‐dimensional Banach space has a well‐orderable Hamel basis of cardinality ” is provable in ; (the Axiom of Choice for denumerable families of non‐empty finite sets) is equivalent to “no infinite‐dimensional Banach space has a Hamel basis which can be written as a denumerable union of finite sets”; Mazur's Lemma (“If X is an infinite‐dimensional Banach space, Y is a finite‐dimensional vector subspace of X, and, then there is a unit vector such that for all and all scalars α”) is provable in ; “A real normed vector space X is finite‐dimensional if and only if its closed unit ball is compact” is provable in ; (Principle of Dependent Choices) + “ can be well‐ordered” does not imply the Hahn‐Banach Theorem () in ; and “no infinite‐dimensional Banach space has a Hamel basis of cardinality ” are independent from each other in ; “No infinite‐dimensional Banach space can be written as a denumerable union of finite‐dimensional subspaces” lies in strength between (the Axiom of Countable Choice) and ; implies “No infinite‐dimensional Banach space can be written as a denumerable union of closed proper subspaces” which in turn implies ; “Every infinite‐dimensional Banach space has a denumerable linearly independent subset” is a theorem of, but not a theorem of ; and “Every infinite‐dimensional Banach space has a linearly independent subset of cardinality ” implies “every Dedekind‐finite set is finite”. (shrink)

We study within the framework of Zermelo-Fraenkel set theory ZF the role that the axiom of choice plays in the theory of Lindelöf metric spaces. We show that in ZF the weak choice principles: Every Lindelöf metric space is separable and Every Lindelöf metric space is second countable are equivalent. We also prove that a Lindelöf metric space is hereditarily separable iff it is hereditarily Lindelöf iff it hold as well the axiom of choice (...) restricted to countable sets and to topologies of Lindelöf metric spaces as the countable union theorem restricted to Lindelöf metric spaces. (shrink)

We show that the countable axiom of choice CAC strictly implies the statements “Lindelöf metric spaces are second countable” “Lindelöf metric spaces are separable”. We also show that CAC is equivalent to the statement: “If is a Lindelöf topological space with respect to the base ℬ, then is Lindelöf”.

Let ZF denote Zermelo-Fraenkel set theory (without the axiom of choice), and let $M$ be a countable transitive model of ZF. The method of forcing extends $M$ to another model $M\lbrack G\rbrack$ of ZF (a "generic extension"). If the axiom of choice holds in $M$ it also holds in $M\lbrack G\rbrack$, that is, the axiom of choice is preserved by generic extensions. We show that this is not true for many weak forms of (...) the axiom of choice, and we derive an application to Boolean toposes. (shrink)

We study the relationship between the countable axiom of choice and the Tychonoff product theorem for countable families of topological spaces.

We study the role that the axiom of choice plays in Tychonoff's product theorem restricted to countable families of compact, as well as, Lindelöf metric spaces, and in disjoint topological unions of countably many such spaces.

Especially nice models of intuitionistic set theories are realizability models $V$, where $\mathcal A$ is an applicative structure or partial combinatory algebra. This paper is concerned with the preservation of various choice principles in $V$ if assumed in the underlying universe $V$, adopting Constructive Zermelo–Fraenkel as background theory for all of these investigations. Examples of choice principles are the axiom schemes of countable choice, dependent choice, relativized dependent choice and the presentation axiom. (...) It is shown that any of these axioms holds in $V$ for every applicative structure $\mathcal A$ if it holds in the background universe.1 It is also shown that a weak form of the countable axiom of choice, $\textbf{AC}^{\boldsymbol{\omega, \omega }}$, is rendered true in any $V$ regardless of whether it holds in the background universe. The paper extends work by McCarty and Rathjen. (shrink)

We investigate in ZF conditions that are necessary and sufficient for countable products ∏m∈ℕXm of finite Hausdorff spaces Xm resp. Hausdorff spaces Xm with at most n points to be compact resp. Baire. Typica results: Countable products of finite Hausdorff spaces are compact if and only if countable products of non-empty finite sets are non-empty. Countable products of discrete spaces with at most n + 1 points are compact if and only if countable products of (...) non-empty sets with at most n points are non-empty. (shrink)

For a centerless group G, we can define its automorphism tower. We define G α : G 0 = G, G α+1 = Aut(G α ) and for limit ordinals ${G^{\delta}=\bigcup_{\alpha<\delta}G^{\alpha}}$ . Let τ G be the ordinal when the sequence stabilizes. Thomas’ celebrated theorem says ${\tau_{G}<(2^{|G|})^{+}}$ and more. If we consider Thomas’ proof too set theoretical (using Fodor’s lemma), we have here a more direct proof with little set theory. However, set theoretically we get a parallel theorem without the (...) Axiom of Choice. Moreover, we give a descriptive set theoretic approach for calculating an upper bound for τ G for all countable groups G (better than the one an analysis of Thomas’ proof gives). We attach to every element in G α , the αth member of the automorphism tower of G, a unique quantifier free type over G (which is a set of words from ${G*\langle x\rangle}$ ). This situation is generalized by defining “(G, A) is a special pair”. (shrink)

Adjoin, to a countable standard model M of Zermelo-Fraenkel set theory (ZF), a countable set A of independent Cohen generic reals. If one attempts to construct the model generated over M by these reals (not necessarily containing A as an element) as the intersection of all standard models that include M ∪ A, the resulting model fails to satisfy the power set axiom, although it does satisfy all the other ZF axioms. Thus, there is no smallest ZF (...) model including M ∪ A, but there are minimal such models. These are classified by their sets of reals, and there is one minimal model whose set of reals is the smallest possible. We give several characterizations of this model, we determine which weak axioms of choice it satisfies, and we show that some better known models are forcing extensions of it. (shrink)

This note explores the common core of constructive, intuitionistic, recursive and classical analysis from an axiomatic standpoint. In addition to clarifying the relation between Kleene’s and Troelstra’s minimal formal theories of numbers and number-theoretic sequences, we propose some modified choice principles and other function existence axioms which may be of use in reverse constructive analysis. Specifically, we consider the function comprehension principles assumed by the two minimal theories EL and M, introduce an axiom schema CFd asserting that every (...) decidable property of numbers has a characteristic function, and use it to describe a precise relationship between the minimal theories. We show that the axiom schema AC00 of countable choice can be decomposed into a monotone choice schema AC00m (which guarantees that every Cauchy sequence has a modulus) and a bounded choice schema BC00. We relate various (classically correct) axiom schemas of continuous choice to versions of the bar and fan theorems, suggest a constructive choice schema AC1/2,0 (which incidentally guarantees that every continuous function has a modulus of continuity), and observe a constructive equivalence between restricted versions of the fan theorem and correspondingly restricted bounding axioms \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${AB_{1/2,0}^{2^{\mathbb{n}}}}$$\end{document}. We also introduce a version WKL!! of Weak König’s Lemma with uniqueness which is intermediate in strength between WKL and the decidable fan theorem FTd. (shrink)

The notions of linear and metric independence are investigated in relation to the property: if U is a set of n+1 independent vectors, and X is a set of n independent vectors, then adjoining some vector in U to X results in a set of n+1 independent vectors. It is shown that this property holds in any normed linear space. A related property – that finite-dimensional subspaces are proximinal – is established for strictly convex normed spaces over the real or (...) complex numbers. It follows that metric independence and linear independence are equivalent in such spaces. Proofs are carried out in the context of intuitionistic logic without the axiom of countable choice. (shrink)

It is a long standing open problem whether or not the Axiom of Countable Choice implies the fragment of Martin's Axiom either in or in. In this direction, we provide a partial answer by establishing that the Boolean Prime Ideal Theorem in conjunction with the Countable Union Theorem does not imply restricted to complete Boolean algebras in. Furthermore, we prove that the latter (formally) weaker form of and the Δ‐system Lemma are independent of each other (...) in.We also answer open questions from Tachtsis [16] which concern the status of restricted to complete Boolean algebras in certain Fraenkel–Mostowski permutation models of and we strengthen some results from the above paper. (shrink)

Aim of the paper is to revise Boolos’ reinterpretation of second-order monadic logic in terms of plural quantification ([4], [5]) and expand it to full second order logic. Introducing the idealization of plural acts of choice, performed by a suitable team of agents, we will develop a notion of plural reference . Plural quantification will be then explained in terms of plural reference. As an application, we will sketch a structuralist reconstruction of second-order arithmetic based on the axiom (...) of infinite à la Dedekind, as the unique non-logical axiom. We will also sketch a virtual interpretation of the classical continuum involving no other infinite than a countable plurality of individuals. (shrink)

We show that the statement “separable, countably compact, regular spaces are Baire” is deducible from a strictly weaker form than AC, namely, CAC . We also find some characterizations of the axiom of dependent choices.

Let {: i ∈I } be a family of compact spaces and let X be their Tychonoff product. [MATHEMATICAL SCRIPT CAPITAL C] denotes the family of all basic non-trivial closed subsets of X and [MATHEMATICAL SCRIPT CAPITAL C]R denotes the family of all closed subsets H = V × Πmath imageXi of X, where V is a non-trivial closed subset of Πmath imageXi and QH is a finite non-empty subset of I. We show: Every filterbase ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL (...) C]R extends to a [MATHEMATICAL SCRIPT CAPITAL C]R-ultrafilter ℱ if and only if every family H ⊂ [MATHEMATICAL SCRIPT CAPITAL C] with the finite intersection property extends to a maximal [MATHEMATICAL SCRIPT CAPITAL C] family F with the fip. The proposition “if every filterbase ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL C]R extends to a [MATHEMATICAL SCRIPT CAPITAL C]R-ultrafilter ℱ, then X is compact” is not provable in ZF. The statement “for every family {: i ∈ I } of compact spaces, every filterbase ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL C]R, Y = Πi ∈IYi, extends to a [MATHEMATICAL SCRIPT CAPITAL C]R-ultrafilter ℱ” is equivalent to Tychonoff's compactness theorem. The statement “for every family {: i ∈ ω } of compact spaces, every countable filterbase ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL C]R, X = Πi ∈ωXi, extends to a [MATHEMATICAL SCRIPT CAPITAL C]R-ultrafilter ℱ” is equivalent to Tychonoff's compactness theorem restricted to countable families. The countable Axiom of Choice is equivalent to the proposition “for every family {: i ∈ ω } of compact topological spaces, every countable family ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL C] with the fip extends to a maximal [MATHEMATICAL SCRIPT CAPITAL C] family ℱ with the fip”. (shrink)

It is shown that in ZF Martin's $ \aleph_{0}^{}$-axiom together with the axiom of countable choice for finite sets imply that arbitrary powers 2X of a 2-point discrete space are Baire; and that the latter property implies the following: the axiom of countable choice for finite sets, power sets of infinite sets are Dedekind-infinite, there are no amorphous sets, and weak forms of the Kinna-Wagner principle.

We examine the impact of Suzumura’s (Economica 43:381–390, 1976) consistency property when applied in the context of collective choice rules that are independent of irrelevant alternatives, neutral, and monotonic. An earlier contribution by Blau and Deb (Econometrica 45:871–879, 1977) establishes the existence of a vetoer if the collective relation is required to be complete and acyclical. The purpose of this paper is to explore the possibilities that result if completeness and acyclicity are dropped and Suzumura consistency is imposed instead. (...) A conceptually similar but logically independent version of the combined axiom that requires the collective decision mechanism to be independent, neutral, and monotonic is employed. In the case of a finite population, we obtain an alternative impossibility theorem if a collective choice rule is assumed to be non-degenerate and a modified no veto requirement is imposed instead of Blau and Deb’s (1977) condition. If the population is countably infinite, the impossibility can be avoided but it resurfaces if our new no veto property is extended to a coalitional variant. (shrink)

It is shown that in ZF Martin's -axiom together with the axiom of countable choice for finite sets imply that arbitrary powers 2X of a 2-point discrete space are Baire; and that the latter property implies the following: (a) the axiom of countable choice for finite sets, (b) power sets of infinite sets are Dedekind-infinite, (c) there are no amorphous sets, and (d) weak forms of the Kinna-Wagner principle.

We establish the following results: 1. In ZF (i.e., Zermelo-Fraenkel set theory minus the Axiom of Choice AC), for every set I and for every ordinal number α ≥ ω, the following statements are equivalent: (a) The Tychonoff product of| α| many non-empty finite discrete subsets of I is compact. (b) The union of| α| many non-empty finite subsets of I is well orderable. 2. The statement: For every infinite set I, every closed subset of the Tychonoff product (...) [0, 1] I which consists of functions with finite support is compact, is not provable in ZF set theory. 3. The statement: For every set I, the principle of dependent choices relativised to I implies the Tychonoff product of countably many non-empty finite discrete subsets of I is compact, is not provable in ZF⁰ (i.e., ZF minus the Axiom of Regularity). 4. The statement: For every set I, every ℵ₀-sized family of non-empty finite subsets of I has a choice function implies the Tychonoff product of ℵ₀ many non-empty finite discrete subsets of I is compact, is not provable in ZF⁰. (shrink)

In intuitionistic analysis, a subset of a Polish space like or is called positively Borel if and only if it is an open subset of the space or a closed subset of the space or the result of forming either the countable union or the countable intersection of an infinite sequence of (earlier constructed) positively Borel subsets of the space. The operation of taking the complement is absent from this inductive definition, and, in fact, the complement of a (...) positively Borel set is not always positively Borel itself (see Veldman, 2008a). The main result of Veldman (2008a) is that, assuming Brouwer's Continuity Principle and an Axiom of Countable Choice, one may prove that the hierarchy formed by the positively Borel sets is genuinely growing: every level of the hierarchy contains sets that do not occur at any lower level. The purpose of the present paper is a different one: we want to explore the truly remarkable fine structure of the hierarchy. Brouwer's Continuity Principle again is our main tool. A second axiom proposed by Brouwer, his Thesis on Bars is also used, but only incidentally. (shrink)

A variant of realizability for Heyting arithmetic which validates Church’s thesis with uniqueness condition, but not the general form of Church’s thesis, was introduced by Lifschitz (Proc Am Math Soc 73:101–106, 1979). A Lifschitz counterpart to Kleene’s realizability for functions (in Baire space) was developed by van Oosten (J Symb Log 55:805–821, 1990). In that paper he also extended Lifschitz’ realizability to second order arithmetic. The objective here is to extend it to full intuitionistic Zermelo–Fraenkel set theory, IZF. The machinery (...) would also work for extensions of IZF with large set axioms. In addition to separating Church’s thesis with uniqueness condition from its general form in intuitionistic set theory, we also obtain several interesting corollaries. The interpretation repudiates a weak form of countable choice, ACω,ω, asserting that a countable family of inhabited sets of natural numbers has a choice function. ACω,ω is validated by ordinary Kleene realizability and is of course provable in ZF. On the other hand, a pivotal consequence of ACω,ω, namely that the sets of Cauchy reals and Dedekind reals are isomorphic, remains valid in this interpretation. Another interesting aspect of this realizability is that it validates the lesser limited principle of omniscience. (shrink)

We provide a general criterion for Fraenkel–Mostowski models of $${\textsf{ZFA}}$$ (i.e. Zermelo–Fraenkel set theory weakened to permit the existence of atoms) which implies “every linearly ordered set can be well ordered” ( $${\textsf{LW}}$$ ), and look at six models for $${\textsf{ZFA}}$$ which satisfy this criterion (and thus $${\textsf{LW}}$$ is true in these models) and “every Dedekind finite set is finite” ( $${\textsf{DF}}={\textsf{F}}$$ ) is true, and also consider various forms of choice for well-ordered families of well orderable sets in (...) these models. In Model 1, the axiom of multiple choice for countably infinite families of countably infinite sets ( $${\textsf{MC}}_{\aleph _{0}}^{\aleph _{0}}$$ ) is false. It was the open question of whether or not such a model exists (from Howard and Tachtsis “On metrizability and compactness of certain products without the Axiom of Choice”) that provided the motivation for this paper. In Model 2, which is constructed by first choosing an uncountable regular cardinal in the ground model, a strong form of Dependent choice is true, while the axiom of choice for well-ordered families of finite sets ( $${\textsf{AC}}^{{\textsf{WO}}}_{{\textsf{fin}}}$$ ) is false. Also in this model the axiom of multiple choice for well-ordered families of well orderable sets fails. Model 3 is similar to Model 2 except for the status of $${\textsf{AC}}^{{\textsf{WO}}}_{{\textsf{fin}}}$$ which is unknown. Models 4 and 5 are variations of Model 3. In Model 4 $${\textsf{AC}}_{\textrm{fin}}^{{\textsf{WO}}}$$ is true. The construction of Model 5 begins by choosing a regular successor cardinal in the ground model. Model 6 is the only one in which $$2{\mathfrak {m}} = {\mathfrak {m}}$$ for every infinite cardinal number $${\mathfrak {m}}$$. We show that the union of a well-ordered family of well orderable sets is well orderable in Model 6 and that the axiom of multiple countable choice is false. (shrink)

We show that there is a model of ZF in which the Borel hierarchy on the reals has length ω2. This implies that ω1 has countable cofinality, so the axiom of choice fails very badly in our model. A similar argument produces models of ZF in which the Borel hierarchy has exactly λ + 1 levels for any given limit ordinal λ less than ω2. We also show that assuming a large cardinal hypothesis there are models of (...) ZF in which the Borel hierarchy is arbitrarily long. (shrink)

We generalize the ultrapower in a way suitable for choiceless set theory. Given an ultrafilter, forcing is used to construct an extended ultrapower of the universe, designed so that the fundamental theorem of ultrapowers holds even in the absence of the axiom of choice. If, in addition, we assume DC, then an extended ultrapower of the universe by a countably complete ultrafilter must be well-founded. As an application, we prove the Vopěnka-Hrbáček theorem from ZF + DC only (the (...) proof of Vopěnka and Hrbáček used the full axiom of choice): if there exists a strongly compact cardinal, then the universe is not constructible from a set. The same method shows that, in L[ 2 ω ], there cannot exist a θ-compact cardinal less than θ (where θ is the least cardinal onto which the continuum cannot be mapped); a similar result can be proven for other models of the form L[ A ]. The result for L[ 2 ω ] is of particular interest in connection with the axiom of determinacy. The extended ultrapower construction of this paper is an improved version of the author's earlier pseudo-ultrapower method, making use of forcing rather than the omitting types theorem. (shrink)

A Polish group G is tame if for any continuous action of G, the corresponding orbit equivalence relation is Borel. When [Formula: see text] for countable abelian [Formula: see text], Solecki [Equivalence relations induced by actions of Polish groups, Trans. Amer. Math. Soc. 347 (1995) 4765–4777] gave a characterization for when G is tame. In [L. Ding and S. Gao, Non-archimedean abelian Polish groups and their actions, Adv. Math. 307 (2017) 312–343], Ding and Gao showed that for such G, (...) the orbit equivalence relation must in fact be potentially [Formula: see text], while conjecturing that the optimal bound could be [Formula: see text]. We show that the optimal bound is [Formula: see text] by constructing an action of such a group G which is not potentially [Formula: see text], and show how to modify the analysis of [L. Ding and S. Gao, Non-archimedean abelian Polish groups and their actions, Adv. Math. 307 (2017) 312–343] to get this slightly better upper bound. It follows, using the results of Hjorth et al. [Borel equivalence relations induced by actions of the symmetric group, Ann. Pure Appl. Logic 92 (1998) 63–112], that this is the optimal bound for the potential complexity of actions of tame abelian product groups. Our lower-bound analysis involves forcing over models of set theory where choice fails for sequences of finite sets. (shrink)

In intuitionistic analysis, "Brouwer's Continuity Principle" implies, together with an "Axiom of Countable Choice", that the positively Borel sets form a genuinely growing hierarchy: every level of the hierarchy contains sets that do not occur at any lower level.

Discusses Frege's formal definitions and characterizations of infinite and finite sets. Speculates that Frege might have discovered the "oddity" in Dedekind's famous proof that all infinite sets are Dedekind infinite and, in doing so, stumbled across an axiom of countable choice.

Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to be fundamental in constructive locale theory. We show that the two notions are intimately connected.Bishop defines a metric space to be compact if it is complete and totally bounded. A subset of a totally bounded set is again totally bounded iff it is located. So a closed subset of a Bishop compact (...) set is Bishop compact iff it is located. We translate this result to formal topology. ‘Bishop compact’ is translated as compact and overt. We propose a definition of locatedness on subspaces of a formal topology, and prove that a closed subspace of a compact regular formal space is located iff it is overt. Moreover, a Bishop-closed subset of a complete metric space is Bishop compact — that is, totally bounded and complete — iff its localic completion is compact overt.Finally, we show by elementary methods that the points of the Vietoris locale of a compact regular locale are precisely its compact overt sublocales.We work constructively, predicatively and avoid the use of the axiom of countable choice. (shrink)

Discusses Frege's formal definitions and characterizations of infinite and finite sets. Speculates that Frege might have discovered the "oddity" in Dedekind's famous proof that all infinite sets are Dedekind infinite and, in doing so, stumbled across an axiom of countable choice.

It is well known that, in a topological space, the open sets can be characterized using ?lter convergence. In ZF , we cannot replace filters by ultrafilters. It is proven that the ultra?lter convergence determines the open sets for every topological space if and only if the Ultrafilter Theorem holds. More, we can also prove that the Ultra?lter Theorem is equivalent to the fact that uX = kX for every topological space X, where k is the usual Kuratowski closure operator (...) and u is the Ultra?lter Closure with uX := {x ∈ X: [U converges to x and A ∈ U ]}. However, it is possible to built a topological space X for which uX ≠ kX, but the open sets are characterized by the ultra?lter convergence. To do so, it is proved that if every set has a free ultra?lter, then the Axiom of Countable Choice holds for families of non-empty finite sets. It is also investigated under which set theoretic conditions the equality u = k is true in some subclasses of topological spaces, such as metric spaces, second countable T0-spaces or {ℝ}. (shrink)

A Hausdorff space is called effectively Hausdorff if there exists a function F—called a Hausdorff operator—such that, for every with,, where U and V are disjoint open neighborhoods of x and y, respectively. Among other results, we establish the following in, i.e., in Zermelo–Fraenkel set theory without the Axiom of Choice (): is equivalent to “For every set X, the Cantor cube is effectively Hausdorff”. This enhances the result of Howard, Keremedis, Rubin and Rubin [13] that is equivalent (...) to “Hausdorff spaces are effectively Hausdorff” in. The Boolean Prime Ideal Theorem and the statement “For every infinite set X, the Stone space of the Boolean algebra is effectively Hausdorff” are mutually independent. In particular, the latter statement is not provable in. The Axiom of Choice for non‐empty subsets of () is equivalent to each of “Separable Hausdorff spaces are effectively Hausdorff” and “The Cantor cube is effectively Hausdorff”. The Principle of Dependent Choices in conjunction with the Axiom of Choice for continuum sized families of non‐empty subsets of does not imply the axiom of choice for partitions of. The latter independence result fills the gap in information in Howard and Rubin's book “Consequences of the Axiom of Choice”. The axiom of countable choice for non‐empty subsets of is equivalent to each of “Denumerable Hausdorff spaces are effectively Hausdorff”, “Denumerable T3 spaces are completely normal” and “Denumerable Tychonoff spaces are Urysohn”. (shrink)

We show that there is a [Formula: see text]-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a [Formula: see text]-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that the Reflection Principle, stating that every formula reflects to a transitive set, can fail in models of [Formula: see text]. This work is a rediscovery by the first two authors of a result obtained by the third author (...) in [V. G. Kanovei, On descriptive forms of the countable axiom of choice, Investigations on nonclassical logics and set theory, Work Collect., Moscow, 3-136 ]. (shrink)

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${B\subseteq 2^\omega}$$\end{document} is a Gδσ-set then either B is countable or B contains a perfect subset. Second, we prove that if 2ω is the countable union of countable sets, then there exists an Fσδ set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} (...) \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${C\subseteq 2^\omega}$$\end{document} such that C is uncountable but contains no perfect subset. Finally, we construct a model of ZF in which we have an infinite Dedekind finite \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${D\subseteq 2^\omega}$$\end{document} which is Fσδ. (shrink)