English
Related papers

Related papers: Does $\mathsf{DC}$ imply $\mathsf{AC}_\omega$, uni…

200 papers

An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…

General Topology · Mathematics 2022-06-07 Peter Nyikos , Lyubomyr Zdomskyy

In the Zermelo--Fraenkel set theory with the Axiom of Choice a forcing notion is "$\kappa$-distributive" if and only if it is "$\kappa$-sequential". We show that without the Axiom of Choice this equivalence fails, even if we include a weak…

Logic · Mathematics 2022-12-22 Asaf Karagila , Jonathan Schilhan

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Logic in Computer Science · Computer Science 2017-01-03 Minseong Kim

This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of…

Logic · Mathematics 2026-02-24 Valentyn Khokhlov

Let $n\in\omega$. The weak choice principle $\operatorname{RC}_n$ states that for every infinite set $x$ there is an infinite subset $y\subseteq x$ with a choice function on $[y]^n:=\{z\subseteq y\mid \lvert z\rvert =n\}$.…

Logic · Mathematics 2021-01-20 Lorenz Halbeisen , Salome Schumacher

We propose an AC-independent proof of the existence of a non-measurable set as a consequence of the Hahn-Banach theorem of functional analysis which is known to be strictly weaker than AC.

Functional Analysis · Mathematics 2026-05-22 M. A. Sofi

We prove forcing axiom equivalents of two families of weakenings of the axiom of choice: a trichotomy principle for cardinals isolated by L\'evy, ${\rm H\hskip0.05pt}_\kappa$, and ${\rm DC}_\kappa$, the principle of dependent choices…

Logic · Mathematics 2025-02-19 Diego Lima Bomfim , Charles Morgan , Samuel Gomes da Silva

In what follows, essentially two things will be accomplished: Firstly, it will be proven that a version of the Arzel\`a--Ascoli theorem and the Fr\'echet--Kolmogorov theorem are equivalent to the axiom of countable choice for subsets of…

Logic · Mathematics 2018-03-23 Adrian Fellhauer

The replacement (or collection or choice) axiom scheme asserts bounded quantifier exchange. We prove the independence of this scheme from various weak theories of arithmetic, sometimes under a complexity assumption.

Logic in Computer Science · Computer Science 2007-05-23 Stephen Cook , Neil Thapen

This paper presents two types of results related to hyperarithmetic analysis. First, we introduce new variants of the dependent choice axiom, namely $\mathrm{unique}~\Pi^1_0(\mathrm{resp.}~\Sigma^1_1)\text{-}\mathsf{DC}_0$ and…

Logic · Mathematics 2024-11-26 Koki Hashimoto

We consider variants on the classical Berz sublinearity theorem, using only DC, the Axiom of Dependent Choices, rather than AC, the Axiom of Choice which Berz used. We consider thinned versions, in which conditions are imposed on only part…

Classical Analysis and ODEs · Mathematics 2017-12-15 N. H. Bingham , A. J. Ostaszewski

We show in Bishop's constructive mathematics---in particular, using countable choice---that weak K\"{o}nig's lemma implies the uniform continuity theorem.

Logic · Mathematics 2016-11-09 Matthew Hendtlass

In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite…

Logic · Mathematics 2016-09-06 Lorenz Halbeisen , Saharon Shelah

We introduce finite support iterations of symmetric systems, and use them to provide a strongly modernized proof of David Pincus' classical result that the axiom of dependent choice is independent over ZF with the ordering principle…

Logic · Mathematics 2026-01-14 Peter Holy , Jonathan Schilhan

This paper introduces the axiom of Negative Dominance, stating that if a lottery $f$ is strictly preferred to a lottery $g$, then some outcome in the support of $f$ is strictly preferred to some outcome in the support of $g$. It is shown…

Theoretical Economics · Economics 2023-11-16 Harvey Lederman

The principle $ADS$ asserts that every linear order on $\omega$ has an infinite ascending or descending sequence. This has been studied extensively in the reverse mathematics literature, beginning with the work of Hirschfeldt and Shore. We…

Logic · Mathematics 2016-05-23 Eric P. Astor , Damir D. Dzhafarov , Reed Solomon , Jacob Suggs

We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…

Logic · Mathematics 2010-10-01 Damir D. Dzhafarov , Carl Mummert

We show that the Axiom of Real Determinacy $\mathsf{AD}_{\mathbb{R}}$ and the Axiom of Real Blackwell Determinacy $\mathsf{Bl}\text{-}\mathsf{AD}_{\mathbb{R}}$ are equivalent in $\mathsf{ZF}$+$\mathsf{DC}$. This answers the question of…

Logic · Mathematics 2026-03-18 Daisuke Ikegami , W. Hugh Woodin

We give a simple example of a set that is weakly Dedekind infinite (= can be mapped onto omega) but dually Dedekind finite (=cannot be mapped noninjectively onto itself), namely, the power set of a superamorphous set. (A infinite set is…

Logic · Mathematics 2016-09-06 Martin Goldstern

For every natural number $n$ we introduce a new weak choice principle $\mathrm{nRC_{fin}}$: Given any infinite set $x$, there is an infinite subset $y\subseteq x$ and a selection function $f$ that chooses an $n$-element subset from every…

Logic · Mathematics 2026-02-25 Lorenz Halbeisen , Riccardo Plati , Salome Schumacher