English
Related papers

Related papers: What is the theory ZFC without power set?

200 papers

If ZFC is consistent, then each of the following are consistent with ZFC + 2^{{aleph_0}}= aleph_2 : 1.) X subseteq R is of strong measure zero iff |X| <= aleph_1 + there is a generalized Sierpinski set. 2.) The union of aleph_1 many strong…

Logic · Mathematics 2009-09-25 Martin Goldstern , Haim Judah , Saharon Shelah

In this paper, we provide a positive answer to the question of Matthews whether $\mathsf{ZF}^-$ is consistent with a non-trivial cofinal Reinhardt elementary embedding $j\colon V\to V$. The consistency follows from $\mathsf{ZFC} + I_0$, and…

Logic · Mathematics 2025-08-08 Hanul Jeon

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

Logic · Mathematics 2007-05-23 Peter Koepke , Martin Koerwien

Let $(X, +)$ denote $(\mathbb{R}, +)$ or $(2^{\omega}, +_2)$. We prove that for any meagre set $F \subseteq X$ there exists a subgroup $G \le X$ without the Baire property, disjoint with some translation of F. We point out several…

General Topology · Mathematics 2018-03-20 Ziemowit Kostana

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

Logic · Mathematics 2026-02-20 Asaf Karagila , Jonathan Schilhan

We prove a compactness theorem for pseudopower operations of the form $pp_{\Gamma(\mu,\sigma)}(\mu)$ where $\aleph_0<\sigma=cf(\sigma)\leq cf(\mu)$. Our main tool is a result that has Shelah's cov vs. pp Theorem as a consequence. We also…

Logic · Mathematics 2019-06-25 Todd Eisworth

This article was motivated by the discovery of a potential new foundation for mainstream mathematics. The goals are to clarify the relationships between primitives, foundations, and deductive practice; to understand how to determine what…

History and Overview · Mathematics 2025-02-18 Frank Quinn

In light of the celebrated theorem of Vop\v{e}nka (1972), proving in ZFC that every set is generic over HOD, it is natural to inquire whether the set-theoretic universe $V$ must be a class-forcing extension of HOD by some possibly…

Logic · Mathematics 2017-09-25 Joel David Hamkins , Jonas Reitz

We show that (1) If ZF is consistent then the following theory is consistent "ZF + DC(omega_{1}) + Every set of reals has Baire property" and (2) If ZF is consistent then the following theory is consistent "ZFC + `every projective set of…

Logic · Mathematics 2019-08-27 Haim Judah , Saharon Shelah

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…

Logic · Mathematics 2021-04-06 Jan Reimann , Theodore A. Slaman

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

In generic realizability for set theories, realizers treat unbounded quantifiers generically. To this form of realizability, we add another layer of extensionality by requiring that realizers ought to act extensionally on realizers, giving…

Logic · Mathematics 2020-12-22 Emanuele Frittaion , Michael Rathjen

It is known that, if we take a countable model of Zermelo--Fraenkel set theory ZFC and "undirect" the membership relation (that is, make a graph by joining $x$ to $y$ if either $x\in y$ or $y\in x$), we obtain the Erd\H{o}s--R\'enyi random…

Logic · Mathematics 2019-06-10 Bea Adam-Day , Peter J. Cameron

Dana Scott had shown that removing Extensionality from ZF set theory formalized in the customary manner would weaken it down to Zermelo set theory. The following proof is my personal attempt to solve the question of whether we can have a…

Logic · Mathematics 2020-10-06 Zuhair Al-Johar

We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…

Logic · Mathematics 2026-04-30 Will Boney

In set theory without the Axiom of Choice, we consider Ingleton's axiom which is the counterpart in ultrametric analysis of the Hahn-Banach axiom. We show that in $ZFA$, set theory without the Axiom of Choice weakened to allow "atoms",…

Logic · Mathematics 2019-01-15 Marianne Morillon

For a countable, weakly minimal theory, we show that the Schroeder-Bernstein property (any two elementarily bi-embeddable models are isomorphic) is equivalent to both a condition on orbits of rank 1 types and the property that the theory…

Logic · Mathematics 2009-12-09 John Goodrick , Michael C. Laskowski

We prove consistency of the following sentence: ``ZFC + every real function is continuous on a non-meagre set'', answering a question of Fremlin.

Logic · Mathematics 2009-09-25 Saharon Shelah

We show there exists a complete theory in a language of size continuum possessing a unique atomic model which is not constructible. We also show it is consistent with $ZFC + \aleph_1 < 2^{\aleph_0}$ that there is a complete theory in a…

Logic · Mathematics 2016-07-27 Douglas Ulrich

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

Logic · Mathematics 2014-11-11 Moti Gitik , Ralf Schindler , Saharon Shelah