English
Related papers

Related papers: Extender-based Magidor-Radin forcings without top …

200 papers

We show that higher Sacks forcing at a regular limit cardinal and club Miller forcing at an uncountable regular cardinal both add a diamond sequence. We answer the longstanding question, whether $\kappa = \kappa^{<\kappa} \geq\aleph_1$…

Logic · Mathematics 2025-04-14 Heike Mildenberger , Saharon Shelah

In this paper we investigate some properties of forcing which can be considered "nice" in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular…

Logic · Mathematics 2018-05-15 Yair Hayut , Asaf Karagila

Motivated by showing that in ZFC we cannot construct a special Aronszajn tree on some cardinal greater than $\aleph_1$, we produce a model in which the approachability property fails (hence there are no special Aronszajn trees) at all…

Logic · Mathematics 2018-06-12 Spencer Unger

Let $A$ be an additive basis of order $h$ and $X$ be a finite nonempty subset of $A$ such that the set $A \setminus X$ is still a basis. In this article, we give several upper bounds for the order of $A \setminus X$ in function of the order…

Number Theory · Mathematics 2009-02-19 Bakir Farhi

The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…

Logic · Mathematics 2011-10-18 A. Kiselev

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

Logic · Mathematics 2023-06-22 Natasha Dobrinen , Daniel Hathaway

In a series of publications [\ref{LNWW},\ref{Schroedinger}], L\"uscher et al. have demonstrated the usefulness of the Schr\"odinger functional in pure SU(2) and SU(3) gauge theory. In this paper, it is shown how their formalism can be…

High Energy Physics - Lattice · Physics 2016-08-31 Stefan Sint

The paper has a threefold purpose. The first purpose is to present an explicit description of expanded cyclic codes defined in $\GF(q^m)$. The proposed explicit construction of expanded generator matrix and expanded parity check matrix…

Information Theory · Computer Science 2008-07-08 Yingquan Wu

We study the nonstationary-support iteration of Prikry forcings below a measurable cardinal \kappa, characterizing all the normal measures it carries in the generic extension. We then analyze the restriction of ultrapower embeddings, taken…

Logic · Mathematics 2021-09-23 Moti Gitik , Eyal Kaplan

We introduce 0^h (0^handgrenade) as a sharp for an inner model with a proper class of strong cardinals. If 0^h does not exist then any normal iteration tree is "almost linear." We exploit this fact to prove the existence of the core model K…

Logic · Mathematics 2007-05-23 Ralf-Dieter Schindler

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

Logic · Mathematics 2023-01-02 Daisuke Ikegami , Philipp Schlicht

Starting from large cardinals we construct a pair $V_1\subseteq V_2$ of models of $ZFC$ with the same cardinals and cofinalities such that $GCH$ holds in $V_1$ and fails everywhere in $V_2$.

Logic · Mathematics 2015-10-13 Sy David Friedman , Mohammad Golshani

We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…

Logic · Mathematics 2011-10-18 Jakob Kellner , Saharon Shelah

We improve the upper bound for the consistency strength of stationary reflection at successors of singular cardinals.

Logic · Mathematics 2021-07-01 Yair Hayut , Spencer Unger

The work presents the second part of the second edition of its previous one published in 2000 under the same title, containing the proof (in ZF) of the inaccessible cardinals nonexistence, which is enriched and improved now. This part…

Logic · Mathematics 2011-10-13 A. Kiselev

Starting from a model with a Laver-indestructible supercompact cardinal $\kappa$, we construct a model of $ZF+DC_{\kappa}$ where there are no $\kappa$-mad families.

Logic · Mathematics 2019-06-25 Haim Horowitz , Saharon Shelah

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

Logic · Mathematics 2010-12-10 Matteo Viale , Christoph Weiß

It is known that the behavior of the Mitchell order substantially changes at the level of rank-to-rank extenders, as it ceases to be well-founded. While the possible partial order structure of the Mitchell order below rank-to-rank extenders…

Logic · Mathematics 2021-01-19 Omer Ben-Neria , Sandra Müller

We use a recently proposed covariant procedure to reduce the Chern-Simons action of three-dimensional higher-spin gravity to the boundary, resulting in a Lorentz covariant action for higher-order chiral scalars. After gauge-fixing, we…

High Energy Physics - Theory · Physics 2025-04-15 Calvin Yi-Ren Chen , Euihun Joung , Karapet Mkrtchyan , Junggi Yoon

It is known that the set of possible cofinalities $\mathrm{pcf}(A)$ has good properties if $A$ is a progressive interval of regular cardinals. In this paper, we give an interval of regular cardinals $A$ such that $\mathrm{pcf}(A)$ has no…

Logic · Mathematics 2022-01-10 Kenta Tsukuura