English
Related papers

Related papers: Dependent Choice, Properness, and Generic Absolute…

200 papers

We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…

Functional Analysis · Mathematics 2008-12-18 Marianne Morillon

Let $\Gamma^\infty$ be the set of all universally Baire sets of reals. Inspired by recent work of the second author and Nam Trang, we introduce a new technique for establishing generic absoluteness results for models containing…

Logic · Mathematics 2025-04-16 Sandra Müller , Grigor Sargsyan

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

We present a simple proof of a well-known axiomatic characterization of state-salient decision rules, using Weak Dominance Criterion and Global Independence of Irrelevant Alternatives. Subsequently we provide a simple axiomatic…

Optimization and Control · Mathematics 2025-03-11 Somdeb Lahiri

The relationship between the large cardinal notions of strong compactness and supercompactness cannot be determined under the standard ZFC axioms of set theory. Under a hypothesis called the Ultrapower Axiom, we prove that the notions are…

Logic · Mathematics 2018-10-12 Gabriel Goldberg

The consistency of the theory $\mathsf{ZF} + \mathsf{AD}_{\mathbb{R}} + {}$``every set of reals is universally Baire'' is proved relative to $\mathsf{ZFC} + {}$``there is a cardinal that is a limit of Woodin cardinals and of strong…

Logic · Mathematics 2025-06-18 Paul B. Larson , Grigor Sargsyan , Trevor Wilson

The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…

Logic · Mathematics 2016-07-07 Sy David Friedman , Sakaé Fuchino , Hiroshi Sakai

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Logic · Mathematics 2012-06-12 Andreas Fackler

In this paper we show how to build a model of $ZFC$ such that all its inner models satisfying the Axiom of Choice are well-ordered with respect to inclusion, and that said ordering is of arbitrary height (including possibly $Ord$ high). We…

Logic · Mathematics 2018-12-18 Alon Navon

In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear…

Logic · Mathematics 2013-10-08 Justin Tatch Moore

We consider the following statistical estimation problem: given a family F of real valued functions over some domain X and an i.i.d. sample drawn from an unknown distribution P over X, find h in F such that the expectation of h w.r.t. P is…

Machine Learning · Computer Science 2017-11-15 Shai Ben-David , Pavel Hrubes , Shay Moran , Amir Shpilka , Amir Yehudayoff

We work in the setting of Zermelo-Fraenkel set theory without assuming the Axiom of Choice. We consider sets with the Boolean operations together with the additional structure of comparing cardinality (in the Cantorian sense of injections).…

Logic · Mathematics 2025-01-16 Matthew Harrison-Trainor , Dhruv Kulshreshtha

In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…

Rings and Algebras · Mathematics 2023-11-01 Kijti Rodtes

Let $\mathcal{SN}$ be the $\sigma$-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of $\mathcal{SN}$ after finite support iterations. This is applied…

Logic · Mathematics 2025-08-21 Jörg Brendle , Miguel A. Cardona , Diego A. Mejía

We provide solutions to several problems of Foreman about ideals, several of which are closely related to Mitchell's notion of \emph{strongly proper} forcing. We prove: 1) Presaturation of a normal ideal implies projective antichain…

Logic · Mathematics 2018-03-13 Sean Cox , Monroe Eskew

It is known that the assumption that ``GCH first fails at \aleph_{\omega}'' leads to large cardinals in ZFC. Gitik and Koepke have demonstrated that this is not so in ZF: namely there is a generic cardinal-preserving extension of L (or any…

Logic · Mathematics 2010-08-23 Vladimir Kanovei

In "Extensional realizability for intuitionistic set theory", we introduced an extensional variant of generic realizability, where realizers act extensionally on realizers, and showed that this form of realizability provides "inner" models…

Logic · Mathematics 2024-12-10 Emanuele Frittaion

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…

Logic · Mathematics 2019-11-20 Takako Nemoto , Michael Rathjen

Cicho\'n's diagram describes the connections between combinatorial notions related to measure, category, and compactness of sets of irrational numbers. In the second part of the 2010's, Goldstern, Kellner and Shelah constructed a forcing…

Logic · Mathematics 2026-04-01 Diego A. Mejía

Viale \cite{Viale_GuessingModel} introduced the notion of Generic Laver Diamond at $\kappa$---which we denote $\Diamond_{\text{Lav}}(\kappa)$---asserting the existence of a single function from $\kappa \to H_\kappa$ that behaves much like a…

Logic · Mathematics 2014-05-13 Sean D. Cox