English
Related papers

Related papers: Some applications of Supercompact Extender Based F…

200 papers

In this paper, we prove that: if $\kappa$ is supercompact and the $\mathsf{HOD}$ Hypothesis holds, then there is a proper class of regular cardinals in $V_{\kappa}$ which are measurable in $\mathsf{HOD}$. Woodin also proved this result. As…

Logic · Mathematics 2025-10-02 Yong Cheng

We study the question, what computational power is sufficient to perform constructions using either Laver or Hechler forcing. As a result, we obtain a separation between three relativised non-lowness classes that are the…

Logic · Mathematics 2026-05-12 Noam Greenberg , Gian Marco Osso

Continuing \cite{GitJir22}, we develop a version of Extender-based Magidor-Radin forcing where there are no extenders on the top ordinal. As an application, we provide another approach to obtain a failure of SCH on a club subset of an…

Logic · Mathematics 2023-06-23 Moti Gitik , Sittinon Jirattikansakul

In the first part of the manuscript, we establish several consistency results concerning Woodin's $\HOD$ hypothesis and large cardinals around the level of extendibility. First, we prove that the first extendible cardinal can be the first…

Logic · Mathematics 2024-11-07 Gabriel Goldberg , Jonathan Osinski , Alejandro Poveda

A ccc-generically supercompact cardinal $\kappa$ can be smaller than or equal to the continuum. On the other hand, such a cardinal $\kappa$ still satisfies diverse largeness properties, like that it is a stationary limit of ccc-generically…

Logic · Mathematics 2022-02-17 Sakaé Fuchino , Hiroshi Sakai

We consider here Easton support iterations of Prikry type forcing notions. New ways of constructing normal ultrafilters in extensions are presented. It turns out that, in contrast with other supports, seemingly unrelated measures or…

Logic · Mathematics 2023-01-31 Moti Gitik , Eyal Kaplan

In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…

Logic · Mathematics 2014-12-11 Julia Knight , Antonio Montalban , Noah Schweber

Let $D$ be an infinite discrete set of measurable cardinals. It is shown that generalized Prikry forcing to add a countable sequence to each cardinal in $D$ is subcomplete. To do this it is shown that a simplified version of generalized…

Logic · Mathematics 2018-12-31 Kaethe Minden

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ß

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

We give an application of our extender based Radin forcing to cardinal arithmetic. Using a preparation forcing and interleaving of Cohen and Levy forcings in the normal Radin sequence we get a model with a power function having a fixed…

Logic · Mathematics 2007-05-23 Carmi Merimovich

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

We analyze the intermediate models of the strongly compact Prikry forcing. We exhibit a simple combinatorial property which, for a given supercompact cardinal $\kappa$, characterize the projections of all projections of the strongly compact…

Logic · Mathematics 2026-05-12 Tom Benhamou , Sebastiano Thei , Ben-Zion Weltsch

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

We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…

Logic · Mathematics 2026-04-30 Will Boney

We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…

Information Theory · Computer Science 2024-05-30 Ferruh Ozbudak , Paolo Santonastaso , Ferdinando Zullo

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

Answering a question of Usuba, we show that an extendible cardinal can be preserved by a set forcing that is not a small forcing.

Logic · Mathematics 2021-08-17 Gabriel Goldberg

The landmark Levy-Solovay Theorem limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that…

Logic · Mathematics 2007-05-23 Joel David Hamkins

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