English
Related papers

Related papers: Generic large cardinals as axioms

200 papers

We show that the weakest versions of Foreman's minimal generic hugeness axioms cannot hold simultaneously on adjacent cardinals. Moreover, conventional forcing techniques cannot produce a model of one of these axioms.

Logic · Mathematics 2023-03-27 Monroe Eskew

Improving a result of Woodin, we identify some classes of individually consistent but mutually inconsistent generic large cardinal axioms.

Logic · Mathematics 2019-01-07 Monroe Eskew

We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…

Logic · Mathematics 2016-09-07 Harvey M. Friedman

Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…

Logic · Mathematics 2022-01-28 Gabriel Goldberg

Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…

Logic · Mathematics 2015-08-04 Brent Cody , Sean Cox

We introduce and axiomatize the notion of a reflective cardinal, use it to give semantics to higher order set theory, and explore connections between the notion of reflective cardinals and large cardinal axioms.

Logic · Mathematics 2016-12-16 Dmytro Taranovsky

Harvey Friedman, in his remarkable paper Finite functions and the necessary use of large cardinals, Ann. Math. 148:803-893, 1998 and in a technical report, Applications of large cardinals to graph theory, Ohio State University, 1997,…

Combinatorics · Mathematics 2019-09-17 S. Gill Williamson

We introduce the resurrection axioms, a new class of forcing axioms, and the uplifting cardinals, a new large cardinal notion, and prove that various instances of the resurrection axioms are equiconsistent over ZFC with the existence of an…

Logic · Mathematics 2014-02-27 Joel David Hamkins , Thomas A. Johnstone

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 prove that the Generalized Continuum Hypothesis holds above a supercompact cardinal assuming the Ultrapower Axiom, an abstract comparison principle motivated by inner model theory at the level of supercompact cardinals.

Logic · Mathematics 2018-10-12 Gabriel Goldberg

We introduce the notion of $\mathcal{C}$-system of filters, generalizing the standard definitions of both extenders and towers of normal ideals. This provides a framework to develop the theory of extenders and towers in a more general and…

Logic · Mathematics 2017-04-06 Giorgio Audrito , Silvia Steila

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

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

There is no single canonical polynomial-time version of the Axiom of Choice (AC); several statements of AC that are equivalent in Zermelo-Fraenkel (ZF) set theory are already inequivalent from a constructive point of view, and are similarly…

Computational Complexity · Computer Science 2023-01-19 Joshua A. Grochow

We discuss how singular can cardinals be in absence of the axiom of choice. We show that, contrasting with known negative consistency results (of Gitik and others), certain positive results are provable. Then we pose some problems.

Logic · Mathematics 2007-09-18 Denis I. Saveliev

Exacting and ultraexacting cardinals are large cardinal numbers compatible with the Zermelo-Fraenkel axioms of set theory, including the Axiom of Choice. In contrast with standard large cardinal notions, their existence implies that the…

Logic · Mathematics 2025-09-15 Juan Pablo Aguilera , Joan Bagaria , Gabriel Goldberg , Philipp Lücke

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

If we assume the axiom of choice, then every two cardinal numbers are comparable. In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible…

Logic · Mathematics 2007-05-23 Lorenz Halbeisen , Saharon Shelah

Starting from large cardinals we construct a model of $ZFC$ in which the $GCH$ fails everywhere, but such that $GCH$ holds in its $HOD$. The result answers a question of Sy Friedman. Also, relative to the existence of large cardinals, we…

Logic · Mathematics 2015-12-22 Mohammad Golshani

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…

Logic in Computer Science · Computer Science 2018-04-23 Francesco Dagnino
‹ Prev 1 2 3 10 Next ›