English
Related papers

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

200 papers

We consider uniformly (DC) or periodically (AC) driven generalized infinite elastic chains (a generalized Frenkel-Kontorova model) with gradient dynamics. We first show that the union of supports of all the invariant measures, denoted by A,…

Dynamical Systems · Mathematics 2013-05-07 Siniša Slijepčević

We prove some general theorems for preserving Dependent Choice when taking symmetric extensions, some of which are unwritten folklore results. We apply these to various constructions to obtain various simple consistency proofs.

Logic · Mathematics 2019-05-10 Asaf Karagila

This article offers a gentle introduction to the axiom of choice. We introduce the axiom, discuss some common objections to it, and present three kinds of reasons to accept it. Although the exposition is aimed at non-experts in set theory,…

Logic · Mathematics 2026-03-17 Andreas Blass , Dhruv Kulshreshtha

Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…

Logic · Mathematics 2023-09-20 Philipp Lücke , Sandra Müller

A fundamental principle of individual rational choice is Sen's $\gamma$ axiom, also known as expansion consistency, stating that any alternative chosen from each of two menus must be chosen from the union of the menus. Expansion consistency…

Theoretical Economics · Economics 2023-03-28 Wesley H. Holliday , Chase Norman , Eric Pacuit , Saam Zahedian

The famous Michael selection theorem deals with the characterisation of paracompact spaces by continuous selections of lower semi-continuous mappings in Banach spaces. In this paper, we will discuss several equivalent forms of this theorem,…

Functional Analysis · Mathematics 2026-02-26 Valentin Gutev

The second author has recently shown ([20]) that any selectively (a) almost disjoint family must have cardinality strictly less than $2^{\alpeh_0}$, so under the Continuum Hypothesis such a family is necessarily countable. However, it is…

General Topology · Mathematics 2016-09-20 Charles J. G. Morgan , Samuel G. Da Silva

Let $X$ be a quasi-compact and quasi-separated scheme. There are two fundamental and pervasive facts about the unbounded derived category of $X$: (1) $\mathsf{D}_{\mathrm{qc}}(X)$ is compactly generated by perfect complexes and (2) if $X$…

Algebraic Geometry · Mathematics 2015-12-04 Jack Hall , Amnon Neeman , David Rydh

We study mechanism which operate on ordinal preference information (i.e., rank ordered lists of alternatives) on the full domain of weak preferences that admits indifferences. We present a novel decomposition of strategyproofness into three…

Computer Science and Game Theory · Computer Science 2020-07-15 Timo Mennle , Sven Seuken

In set theory without the Axiom of Choice, we study the possible placement of Erdos-Dushnik-Miller theorem restricted to an uncountable set of vertices in the hierarchy of weak choice forms. We also answer a part of a question raised by…

Logic · Mathematics 2023-09-13 Amitayu Banerjee , Alexa Gopaulsingh

We investigate integration of classes of real-valued continuous functions on (0,1]. Of course difficulties arise if there is a non-$L^1$ element in the class, and the Hadamard finite part integral ({\em p.f.}) does not apply. Such singular…

Functional Analysis · Mathematics 2014-08-21 Ovidiu Costin , Harvey M. Friedman

In [G. Curi, "Exact approximations to Stone-Cech compactification'', Ann. Pure Appl. Logic, 146, 2-3, 2007, pp. 103-123] a characterization is obtained of the locales of which the Stone-Cech compactification can be defined in constructive…

Logic · Mathematics 2010-01-12 Giovanni Curi

The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…

Probability · Mathematics 2012-07-24 Philip Herriger

We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…

Logic · Mathematics 2007-05-23 Saharon Shelah , Jindrich Zapletal

Arithmetic circuits (AC) are circuits over the real numbers with 0/1-valued input variables whose gates compute the sum or the product of their inputs. Positive AC -- that is, AC representing non-negative functions -- subsume many…

Computational Complexity · Computer Science 2021-10-26 Alexis de Colnet , Stefan Mengel

Given an unpredictable Boolean function $f: \{0, 1\}^n \rightarrow \{0, 1\}$, the standard Yao's XOR lemma is a statement about the unpredictability of computing $\oplus_{i \in [k]}f(x_i)$ given $x_1, ..., x_k \in \{0, 1\}^n$, whereas the…

Computational Complexity · Computer Science 2019-08-16 Ragesh Jaiswal

There is a model of ZF with a $\Delta^1_3$ definable Hamel basis in which $AC_\omega(R)$ fails.

Logic · Mathematics 2019-02-08 Vladimir Kanovei , Ralf Schindler

A novel selection principle was introduced by Dorantes-Aldama and Shakhmatov: a topological space $X$ is termed {\em selectively pseudocompact} if for any sequence $(U_n:n\in {\omega})$ of pairwise disjoint non-empty open sets of $X$, one…

General Topology · Mathematics 2025-10-21 István Juhász , Lajos Soukup , Zoltán Szentmiklóssy

In a compact topological dynamical system $(X,f)$, we associate to every pair $(x,y)$ a canonical order-theoretic invariant, its emergent order spectrum $\Omega(x,y)$. We first prove that, if $x$ and $y$ are chain-related, one can always…

Dynamical Systems · Mathematics 2026-01-12 F. Ciavattini , A. Della Corte , C. Lucamarini

We prove that some fairly basic questions on automata reading infinite words depend on the models of the axiomatic system ZFC. It is known that there are only three possibilities for the cardinality of the complement of an omega-language…

Formal Languages and Automata Theory · Computer Science 2012-02-02 Olivier Finkel