English
Related papers

Related papers: Huge Reflection

200 papers

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 purpose of this paper is to provide an introductory overview of the large cardinal hierarchy in set theory. By a large cardinal, we mean any cardinal $\kappa$ whose existence is strong enough of an assumption to prove the consistency of…

Logic · Mathematics 2022-05-05 Rohan Srivastava

We give a level-by-level analysis of the Weak Vop\v{e}nka Principle for definable classes of relational structures (WVP), in accordance with the complexity of their definition, and we determine the large-cardinal strength of each level.…

Logic · Mathematics 2020-12-22 Joan Bagaria , Trevor Wilson

We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from…

Logic · Mathematics 2011-10-11 Matteo Viale

In this paper we study the notion of strong non-reflection, and its contrapositive weak reflection. We say theta strongly non-reflects at lambda iff there is a function F: theta ---> lambda such that for all alpha < theta with cf(alpha)=…

Logic · Mathematics 2009-09-25 James Cummings , Mirna Džamonja , Saharon Shelah

This paper establishes a number of constraints on the structure of large cardinals under strong compactness assumptions. These constraints coincide with those imposed by the Ultrapower Axiom, a principle that is expected to hold in Woodin's…

Logic · Mathematics 2020-07-10 Gabriel Goldberg

The weakly compact reflection principle $\text{Refl}_{\text{wc}}(\kappa)$ states that $\kappa$ is a weakly compact cardinal and every weakly compact subset of $\kappa$ has a weakly compact proper initial segment. The weakly compact…

Logic · Mathematics 2017-09-05 Brent Cody , Hiroshi Sakai

The theory ZFC implies the scheme that for every cardinal $\delta$ we can make $\delta$ many dependent choices over any definable relation without terminal nodes. Friedman, the first author, and Kanovei constructed a model of ZFC$^-$ (ZFC…

Logic · Mathematics 2023-09-27 Victoria Gitman , Richard Matthews

Starting from infinitely many supercompact cardinals, we force a model of ZFC where $\aleph_{\omega^2+1}$ satisfies simultaneously a strong principle of reflection, called $\Delta$-reflection, and a version of the square principle, denoted…

Logic · Mathematics 2016-02-04 Laura Fontanella , Yair Hayut

We construct a model of the form $L[A,U]$ that exhibits the simplest structural behavior of $\sigma$-complete ultrafilters in a model of set theory with a single measurable cardinal $\kappa$ , yet satisfies $2^\kappa = \kappa^{++}$. This…

Logic · Mathematics 2024-12-10 Omer Ben-Neria , Eyal Kaplan

A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…

Logic · Mathematics 2017-01-25 Libor Barto , Jakub Opršal , Michael Pinsker

While most network embedding techniques model the proximity between nodes in a network, recently there has been significant interest in structural embeddings that are based on node equivalences, a notion rooted in sociology: equivalences or…

Social and Information Networks · Computer Science 2021-01-15 Junchen Jin , Mark Heimann , Di Jin , Danai Koutra

Combining stationary reflection (a compactness property) with the failure of SCH (an instance of non-compactness) has been a long-standing theme. We obtain this at $\aleph_{\omega_1}$, answering a question of Ben-Neria, Hayut, and Unger: We…

Logic · Mathematics 2024-11-26 Tom Benhamou , Dima Sinapova

We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…

Logic · Mathematics 2011-11-04 Arthur Apter , Victoria Gitman , Joel David Hamkins

Jech proved that every partially ordered set can be embedded into the cardinals of some model of $ZF$. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of $ZF+DC_{<\kappa}$ for…

Logic · Mathematics 2014-06-17 Asaf Karagila

We give a sharper version of a theorem of Rosicky, Trnkova and Adamek, and a new proof of a theorem of Rosicky, both about colimit preservation between categories of structures. Unlike the original proofs, which use category-theoretic…

Logic · Mathematics 2014-10-01 Joan Bagaria , Andrew Brooke-Taylor

The notion of stationary reflection is one of the most important notions of combinatorial set theory. We investigate weak reflection, which is, as the name suggests, a weak version of stationary reflection. This sort of reflection was…

Logic · Mathematics 2007-05-23 Mirna Džamonja , Saharon Shelah

We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…

Logic · Mathematics 2022-10-18 Saharon Shelah

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

Logic · Mathematics 2024-03-19 David Asperó , Sean Cox , Asaf Karagila , Christoph Weiss

Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…

Logic · Mathematics 2016-09-06 Andres Villaveces