中文
相关论文

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

200 篇论文

Vladimir Kanovei \cite{zbMATH01335192} developed the technique of geometric iteration and used it to prove that the perfect set forcing can be iterated with countable supports along any partial order, while preserving $\aleph_1$. In…

逻辑 · 数学 2026-04-14 Mirna Džamonja

We prove that if $\mathcal{A}$ is a $\sigma$-complete Boolean algebra in a model $V$ of set theory and $\mathbb{P}\in V$ is a proper forcing with the Laver property preserving the ground model reals non-meager, then every pointwise…

泛函分析 · 数学 2019-09-23 Damian Sobota , Lyubomyr Zdomskyy

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…

Small forcing always ruins the indestructibility of an indestructible supercompact cardinal. In fact, after small forcing, any cardinal $\kappa$ becomes superdestructible---any further ${<}\kappa$-closed forcing which adds a subset to…

逻辑 · 数学 2016-07-05 Joel David Hamkins

This paper continues the study of the Ramsey-like large cardinals. Ramsey-like cardinals are defined by generalizing the characterization of Ramsey cardinals via the existence of elementary embeddings. Ultrafilters derived from such…

逻辑 · 数学 2011-04-25 Victoria Gitman , Philip Welch

Accessible categories admit a purely category-theoretic replacement for cardinality: the internal size. Generalizing results and methods from arXiv:1708.06782, we examine set-theoretic problems related to internal sizes and prove several…

逻辑 · 数学 2019-06-06 Michael Lieberman , Jiří Rosický , Sebastien Vasey

Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…

We give a detailed proof of the properties of the usual Prikry type forcing notion for turning a measurable cardinal into $\aleph_\omega$.

逻辑 · 数学 2019-02-20 Mohammad Golshani

In the first part of the paper, we show that if $\omega \le \kappa < \lambda$ are cardinals, $\kappa^{<\kappa} = \kappa$, and $\lambda$ is weakly compact, then in $V[\M(\kappa,\lambda)]$ the tree property at $\lambda =…

逻辑 · 数学 2020-04-22 Radek Honzik , Sarka Stejskalova

The Necessary Maximality Principle for c.c.c. forcing asserts that any statement about a real in a c.c.c. extension that could become true in a further c.c.c. extension and remain true in all subsequent c.c.c. extensions, is already true in…

逻辑 · 数学 2007-05-23 Joel David Hamkins , W. Hugh Woodin

Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…

逻辑 · 数学 2015-03-20 Joel David Hamkins , Daniel Evan Seabold

Motivated by results of Bagaria, Magidor and V\"a\"an\"anen, we study characterizations of large cardinal properties through reflection principles for classes of structures. More specifically, we aim to characterize notions from the lower…

逻辑 · 数学 2021-12-09 Philipp Lücke

We show that it is possible to add $\kappa^+-$Cohen subsets to $\kappa$ with a Prikry forcing over $\kappa$. This answers a question from \cite{HayutBenhanouGitik}. A strengthening of non-Galvin property is introduced. It is shown to be…

逻辑 · 数学 2024-05-22 Tom Benhamou , Moti Gitik

Building on work of Holy, L\"ucke and Njegomir \cite{MR3913154} on small embedding characterizations of large cardinals, we use some classical results of Baumgartner (see \cite{MR0384553} and \cite{MR0540770}), to give characterizations of…

逻辑 · 数学 2021-02-22 Brent Cody

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

计算机科学中的逻辑 · 计算机科学 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…

逻辑 · 数学 2015-01-26 David Asperó , Miguel Angel Mota

We show that generalized eventually narrow sequences on a strongly inaccessible cardinal $\kappa$ are preserved under the Cummings-Shaleh non-linear iterations of the higher Hechler forcing on $\kappa$. Moreover assuming GCH,…

逻辑 · 数学 2020-05-25 Ömer Faruk Bağ , Vera Fischer

Fix a set-theoretic universe $V$. We look at small extensions of $V$ as generalised degrees of computability over $V$. We also formalise and investigate the complexity of certain methods one can use to define, in $V$, subclasses of degrees…

逻辑 · 数学 2025-01-03 Desmond Lau

Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…

逻辑 · 数学 2016-09-06 Andres Villaveces

We discuss the effect of adding a single real (for various forcing notions adding reals) on cardinal invariants associated with the continuum (like the unbounding or the dominating number or the cardinals related to measure and category on…

逻辑 · 数学 2009-09-25 Jörg Brendle