中文
相关论文

相关论文: Gap forcing: generalizing the Levy-Solovay theorem

200 篇论文

Introducing unfoldable cardinals last year, Andres Villaveces ingeniously extended the notion of weak compactness to a larger context, thereby producing a large cardinal notion, unfoldability, with some of the feel and flavor of weak…

逻辑 · 数学 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…

逻辑 · 数学 2018-05-15 Yair Hayut , Asaf Karagila

Given a Fra\"{i}ss\'{e} class $\mathcal{K}$ and an infinite cardinal $\kappa,$ we define a forcing notion which adds a structure of size $\kappa$ using elements of $\mathcal{K}$, which extends the Fra\"{i}ss\'{e} construction in the case…

逻辑 · 数学 2021-09-24 Mohammad Golshani

From a suitable large cardinal hypothesis, we provide a model with a supercompact cardinal in which universal indestructibility holds: every supercompact and partially supercompact cardinal kappa is fully indestructible by kappa-directed…

逻辑 · 数学 2007-05-23 Arthur W. Apter , Joel David Hamkins

We lower substantially the strength of the assumptions needed for the validity of certain results in category theory and homotopy theory which were known to follow from Vopenka's principle. We prove that the necessary large-cardinal…

范畴论 · 数学 2012-12-04 Joan Bagaria , Carles Casacuberta , A. R. D. Mathias , Jiri Rosicky

The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery…

逻辑 · 数学 2007-05-23 Joel David Hamkins

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…

逻辑 · 数学 2018-12-31 Kaethe Minden

This paper explores several topics related to Woodin's HOD conjecture. We improve the large cardinal hypothesis of Woodin's HOD dichotomy theorem from an extendible cardinal to a strongly compact cardinal. We show that assuming there is a…

逻辑 · 数学 2021-07-02 Gabriel Goldberg

We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and omega-Erdos cardinals. They are characterized by the existence of "0^sharp-like" embeddings; however, they relativize…

逻辑 · 数学 2007-05-23 Ralf Schindler

We introduce the notion of weakly extendible cardinals and show that these cardinals are characterized in terms of weak compactness of second order logic. The consistency strength and largeness of weakly extendible cardinals are located…

逻辑 · 数学 2023-01-06 Sakaé Fuchino , Hiroshi Sakai

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of…

逻辑 · 数学 2025-09-17 Juan P. Aguilera , Joan Bagaria , Philipp Lücke

We characterize several large cardinal notions by model-theoretic properties of extensions of first-order logic. We show that $\Pi_n$-strong cardinals, and, as a corollary, ``Ord is Woodin" and weak Vop\v{e}nka's Principle, are…

逻辑 · 数学 2025-05-22 Will Boney , Jonathan Osinski

We introduce and study a new type of compactness principle for strong logics that, roughly speaking, infers the consistency of a theory from the consistency of its small fragments in certain outer models of the set-theoretic universe. We…

逻辑 · 数学 2025-04-25 Peter Holy , Philipp Lücke , Sandra Müller

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…

逻辑 · 数学 2023-01-02 Daisuke Ikegami , Philipp Schlicht

In Part I of this series, we introduced a class of notions of forcing which we call Sigma-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are…

逻辑 · 数学 2022-01-19 Alejandro Poveda , Assaf Rinot , Dima Sinapova

After discussing the limitations inherent to all set-theoretic reflection principles akin to those studied by A. L\'evy et. al. in the 1960's, we introduce new principles of reflection based on the general notion of \emph{Structural…

逻辑 · 数学 2021-07-06 Joan Bagaria

In other work we have outlined how, building on ideas of Welch and Roberts, one can motivate believing in the existence of supercompact cardinals. After making this observation we strove to formulate a justification for large-cardinal…

逻辑 · 数学 2018-01-03 Rupert McCallum

We present a forcing for blowing up 2^lambda and making ``many positive polarized partition relations'' (in a sense made precise in (c) of our main theorem) hold in the interval [lambda, 2^lambda]. This generalizes results of [276], Section…

逻辑 · 数学 2007-05-23 Saharon Shelah , Lee Stanley

In this paper, we introduce several classes of Prikry-type forcing notions, two of which are used to produce minimal generic extensions, and the third is applied in $\alpha$-recursion theory to produce minimal covers. The first forcing as a…

逻辑 · 数学 2013-10-04 Yang Sen

The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…

逻辑 · 数学 2013-01-04 Andrzej Roslanowski , Saharon Shelah