English
Related papers

Related papers: Choiceless cardinals and the continuum problem

200 papers

We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…

Formal Languages and Automata Theory · Computer Science 2020-07-17 Petra Wolf

Our theme is that not every interesting question in set theory is independent of $ZFC$. We give an example of a first order theory $T$ with countable $D(T)$ which cannot have a universal model at $\aleph_1$ without CH; we prove in $ZFC$ a…

Logic · Mathematics 2009-09-25 Menachem Kojman , Saharon Shelah

Accessible categories admit a purely category-theoretic replacement for cardinality: the internal size. Generalizing results and methods from arXiv:1708.06782, we examine set-theoretic problems related to internal sizes and prove several…

Logic · Mathematics 2019-06-06 Michael Lieberman , Jiří Rosický , Sebastien Vasey

The paper settles the problem of the consistency of the existence of a single universal graph between a strong limit singular and its power. Assuming that in a model of $\mathbf{GCH}$ $\kappa$ is supercompact and the cardinals $\theta <…

Logic · Mathematics 2022-01-04 Márk Poór , Saharon Shelah

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $\kappa$, let {\sf BC}$_{\kappa}$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture.…

Logic · Mathematics 2012-07-06 Fred Galvin , Marion Scheepers

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of…

Logic · Mathematics 2025-09-17 Juan P. Aguilera , Joan Bagaria , Philipp Lücke

Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…

Logic · Mathematics 2015-03-20 Joel David Hamkins , Daniel Evan Seabold

We study Structural Reflection beyond Vop\v{e}nka's Principle, at the level of almost-huge cardinals and higher, up to rank-into-rank embeddings. We identify and classify new large cardinal notions in that region that correspond to some…

Logic · Mathematics 2024-01-02 Joan Bagaria , Philipp Lücke

We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…

Logic · Mathematics 2022-03-11 Ali Enayat

We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…

Computational Complexity · Computer Science 2016-02-05 Sylvain Schmitz

Denote by $\continuum=2^{\aleph_0}$ the cardinal of continuum. We construct an intriguing family $(P_\alpha: \alpha\in\continuum)$ of prime $z$-ideals in $\C_0(\reals)$ with the following properties: If $f\in P_{i_0}$ for some…

Rings and Algebras · Mathematics 2014-02-26 Hung Le Pham

We show that Vopenka's Principle and Vopenka cardinals are indestructible under reverse Easton forcing iterations of increasingly directed-closed partial orders, without the need for any preparatory forcing. As a consequence, we are able to…

Logic · Mathematics 2012-02-28 Andrew D. Brooke-Taylor

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

Incomplete pairwise comparison matrices offer a natural way of expressing preferences in decision making processes. Although ordinal information is crucial, there is a bias in the literature: cardinal models dominate. Ordinal models usually…

Optimization and Control · Mathematics 2020-12-15 Luca Faramondi , Gabriele Oliva , Sándor Bozóki

1. For many regular cardinals lambda (in particular, for all successors of singular strong limit cardinals, and for all successors of singular omega-limits), for all n in {2,3,4, ...} : There is a linear order L such that L^n has no…

Logic · Mathematics 2007-05-23 Martin Goldstern , Saharon Shelah

Usuba has asked whether the $\kappa$-mantle, the intersection of all grounds that extend to $V$ via a forcing of size ${<}\kappa$, is always a model of ZFC. We give a negative answers by constructing counterexamples where $\kappa$ is a…

Logic · Mathematics 2024-03-15 Andreas Lietz

We introduce "$n$-choiceless" supercompact and extendible cardinals in Zermelo-Fraenkel set theory without the Axiom of Choice. We prove relations between these cardinals and Vop\v{e}nka's Principle similar to those of Bagaria's work in his…

Logic · Mathematics 2025-05-02 Marwan Salam Mohammd

Strong reflection principles with the reflection cardinal $\leq\aleph_1$ or $<2^{\aleph_0}$ imply that the size of the continuum is either $\aleph_1$ or $\aleph_2$ or very large. Thus, the stipulation, that a strong reflection principle…

Logic · Mathematics 2020-09-08 Sakaé Fuchino , André Ottenbreit Maschio Rodrigues

In this paper, we study the notion of a generically extendible cardinal, which is a generic version of an extendible cardinal. We prove that the generic extendibility of $\omega_1$ or $\omega_2$ has small consistency strength, but that of a…

Logic · Mathematics 2024-11-26 Toshimichi Usuba

We investigate large set axioms defined in terms of elementary embeddings over constructive set theories, focusing on $\mathsf{IKP}$ and $\mathsf{CZF}$. Most previously studied large set axioms, notably the constructive analogues of large…

Logic · Mathematics 2025-03-26 Hanul Jeon , Richard Matthews