English
Related papers

Related papers: Strongest transformations

200 papers

We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…

Logic · Mathematics 2010-12-10 Christoph Weiß

We investigate the infinite version of the $k$-switch problem of Greenwell and Lov\'asz. Given infinite cardinals ${\kappa}$ and ${\lambda}$, for functions $x,y\in {}^{\lambda}\kappa $ we say that they are totally different if $x(i)\ne…

Combinatorics · Mathematics 2025-04-01 Tamás Csernák

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 investigate the existence of strong colorings on successors of singular cardinals. This work continues Section 2 of [Sh:413] (math.LO/9809199), but now our emphasis is on finding colorings of pairs of ordinals, rather than colorings of…

Logic · Mathematics 2009-09-25 Todd Eisworth , Saharon Shelah

One of the crown jewels of complexity theory is Valiant's 1979 theorem that computing the permanent of an n*n matrix is #P-hard. Here we show that, by using the model of linear-optical quantum computing---and in particular, a universality…

Quantum Physics · Physics 2015-05-30 Scott Aaronson

A new class of semi-implicit numerical schemes for linear advection equation on Cartesian grids is derived that is inspired by so-called $\kappa$-schemes used with fully explicit discretizations for this type of problems. Opposite to fully…

Numerical Analysis · Mathematics 2016-11-15 Peter Frolkovič , Karol Mikula

An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…

Logic · Mathematics 2012-05-21 Laura Fontanella

We present an explicit family of hypergraphs with arbitrarily large uniformity and chromatic number that admit realizations in both geometric and number-theoretic settings. As an application, we give a new proof of a theorem of Chen, Pach,…

Combinatorics · Mathematics 2026-02-23 Gábor Damásdi

The main goal of this paper is to generalize the results that where presented in [11] for $\aleph_1$-Kurepa trees to $\aleph_{\alpha+1}$-Kurepa trees. We construct an $\mathcal{L}_{\omega_1,\omega}$-sentence $\psi_{\alpha}$, that codes…

Logic · Mathematics 2024-10-28 Georgios Marangelis

This work is a part of my upcoming thesis [7]. We establish an equiconsistency between (1) weak indestructibility for all $\kappa +2$-degrees of strength for cardinals $\kappa $ in the presence of a proper class of strong cardinals, and (2)…

Logic · Mathematics 2024-11-20 James Holland

Remarkable cardinals were introduced by Schindler, who showed that the existence of a remarkable cardinal is equiconsistent with the assertion that the theory of $L(\mathbb R)$ is absolute for proper forcing. Here, we study the…

Logic · Mathematics 2015-06-10 Yong Cheng , Victoria Gitman

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 show that the notions of "strongly unfoldable cardinals", introduced by Villaveces in his model-theoretic studies of models of set theory, and "shrewd cardinals", introduced by Rathjen in a proof-theoretic context, coincide. We then…

Logic · Mathematics 2021-12-08 Philipp Lücke

Let $\kappa$ be any regular cardinal. Assuming the existence of a huge cardinal above $\kappa$, we prove the consistency of $\binom{\kappa^{++}}{\kappa^+}\rightarrow\binom{\tau}{\kappa^+}$ for every ordinal $\tau<\kappa^{++}$. Likewise, we…

Logic · Mathematics 2017-02-21 Shimon Garti

We show that the existence of a universal countably chromatic graph of size $\aleph_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works…

Logic · Mathematics 2025-11-12 Siiri Kivimäki

Hellsten \cite{MR2026390} proved that when $\kappa$ is $\Pi^1_n$-indescribable, the \emph{$n$-club} subsets of $\kappa$ provide a filter base for the $\Pi^1_n$-indescribability ideal, and hence can also be used to give a characterization of…

Logic · Mathematics 2020-01-31 Brent Cody , Victoria Gitman , Chris Lambie-Hanson

In this paper, we obtain the consistency, relative to large cardinals, of the existence of dense ideals on every successor of a regular cardinal simultaneously. Using a consequent transfer principle, we show that in this model there is a…

Logic · Mathematics 2024-10-21 Monroe Eskew , Yair Hayut

We deal with the problem of preserving various versions of completeness in (< kappa) --support iterations of forcing notions, generalizing the case ``S --complete proper is preserved by CS iterations for a stationary co-stationary S…

Logic · Mathematics 2016-09-07 Saharon Shelah

We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…

Logic · Mathematics 2018-01-30 Dilip Raghavan , Saharon Shelah

Square-kappa-finite, the finite family version of weak square, holds at all cardinals kappa in the Mitchell-Steel inner models.

Logic · Mathematics 2016-09-07 Ernest Schimmerling