English
Related papers

Related papers: Indestructibility of Vopenka's Principle

200 papers

Superstrong cardinals are never Laver indestructible. Similarly, almost huge cardinals, huge cardinals, superhuge cardinals, rank-into-rank cardinals, extendible cardinals, 1-extendible cardinals, 0-extendible cardinals, weakly superstrong…

In the context of large cardinals, the classical diamond principle Diamond_kappa is easily strengthened in natural ways. When kappa is a measurable cardinal, for example, one might ask that a Diamond_kappa sequence anticipate every subset…

Logic · Mathematics 2007-05-23 Joel David Hamkins

Assume ZF($j$) and there is a Reinhardt cardinal, as witnessed by the elementary embedding $j:V\to V$. We investigate the linear iterates $(N_{\alpha},j_{\alpha})$ of $(V,j)$, and their relationship to $(V,j)$, forcing and definability,…

Logic · Mathematics 2020-06-30 Farmer Schlutzenberg

Starting from suitable large cardinals, we force the failure of (weak) diamond at the least inaccessible cardinal. The result improves an unpublished theorem of Woodin and a recent result of Ben-Neria, Garti and Hayut.

Logic · Mathematics 2021-01-27 Mohammad Golshani

A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more…

Logic · Mathematics 2007-11-21 Rüdiger Göbel , Saharon Shelah

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Logic in Computer Science · Computer Science 2017-01-03 Minseong Kim

We show that the existence of a weakly compact cardinal over the Zermelo-Fraenkel's set theory is proof-theoretically reducible to iterations of Mostowski collapsings and Mahlo operations.

Logic · Mathematics 2013-04-11 Toshiyasu Arai

A cardinal $\lambda$ satisfies a property P robustly if, whenever $\mathbb{Q}$ is a forcing poset and $|\mathbb{Q}|^+ < \lambda$, $\lambda$ satisfies P in $V^{\mathbb{Q}}$. We study the extent to which certain reflection properties of large…

Logic · Mathematics 2015-10-19 Chris Lambie-Hanson

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

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

For certain uncountable cardinals $\kappa$ we produce a group of cardinality $\kappa$ which is freely indecomposable, strongly $\kappa$-free, and whose abelianization is free abelian of rank $\kappa$. The construction takes place in…

Group Theory · Mathematics 2020-10-07 Samuel M. Corson

We show that the notions of generic and Laver-generic supercompactness are first-order definable in the language of ZFC. This also holds for generic and Laver-generic (almost) hugeness as well as for generic versions of other large…

Logic · Mathematics 2021-07-01 Sakaé Fuchino , Hiroshi Sakai

We show that every Jonsson cardinal is Ramsey in the Steel core model, provided that this model exists and there is no model with a Woodin cardinal. This basic result is improved in two directions. First, we prove the same result for…

Logic · Mathematics 2016-09-07 William Mitchell

We define forcing orders which add witnesses to the failure of various forms of Friedman's Property. These posets behave similarly to the forcing order adding a nonreflecting stationary set but have the advantage of allowing the…

Logic · Mathematics 2024-11-05 Hannes Jakob

An important classical result in ZFC asserts that every infinite cardinal number is idempotent. Using this fact, we obtain several algebraic results in this article. The first result asserts that an infinite Abelian group has a proper…

Commutative Algebra · Mathematics 2024-09-05 Abolfazl Tarizadeh

In this letter a generic counterexample to the strong cosmic censor conjecture is exhibited. More precisely---taking into account that the conjecture lacks any precise formulation yet---first we make sense of what one would mean by a…

General Relativity and Quantum Cosmology · Physics 2015-10-07 Gabor Etesi

In this article we proved so-called strong reflection principles corresponding to formal theories Th which has omega-models. An posible generalization of the Lob's theorem is considered.Main results is: (1) let $k$ be an inaccessible…

General Mathematics · Mathematics 2019-10-08 Jaykov Foukzon

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…

Logic · Mathematics 2023-10-31 Miloš S. Kurilić

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

Logic · Mathematics 2026-03-19 Saharon Shelah

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…

Logic · Mathematics 2015-03-17 Juan Carlos Martinez , Lajos Soukup