中文
相关论文

相关论文: Coding into K by reasonable forcing

200 篇论文

In this paper we show how to build a model of $ZFC$ such that all its inner models satisfying the Axiom of Choice are well-ordered with respect to inclusion, and that said ordering is of arbitrary height (including possibly $Ord$ high). We…

逻辑 · 数学 2018-12-18 Alon Navon

$\Sigma^1_3$-absoluteness for ccc forcing means that for any ccc forcing $P$, ${H_{\omega_1}}^V \prec_{\Sigma_2}{H_{\omega_1}}^{V^P}$. "$\omega_1$ inaccessible to reals" means that for any real $r$, ${\omega_1}^{L[r]}<\omega_1$. To measure…

逻辑 · 数学 2022-09-20 David Schrittesser

In [2], the authors prove Stillman's conjecture in all characteristics and all degrees by showing that, independent of the algebraically closed field $K$ or the number of variables, $n$ forms of degree at most $d$ in a polynomial ring $R$…

交换代数 · 数学 2020-05-25 Tigran Ananyan , Melvin Hochster

Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…

逻辑 · 数学 2016-09-06 Sy D. Friedman

Any model of ZFC + GCH has a generic extension (made with a poset of size aleph_2) in which the following hold: MA + 2^{aleph_0}= aleph_2+ there exists a Delta^2_1-well ordering of the reals. The proof consists in iterating posets designed…

逻辑 · 数学 2007-05-23 Uri Abraham , Saharon Shelah

Sabok showed that the set of codes for $G_\delta$ Ramsey positive subsets of $[\omega]^\omega$ is $\mathbf{\Sigma}^1_2$-complete. We extend this result by providing sufficient conditions for the set of codes for $G_\delta$ Ramsey positive…

逻辑 · 数学 2024-12-18 Allison Wang

In this article we introduce and study hyperclass-forcing (where the conditions of the forcing notion are themselves classes) in the context of an extension of Morse-Kelley class theory, called MK$^{**}$. We define this forcing by using a…

逻辑 · 数学 2015-10-15 Carolin Antos , Sy-David Friedman

We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…

逻辑 · 数学 2011-11-04 Arthur Apter , Victoria Gitman , Joel David Hamkins

We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable $P$-points, definable tight MAD families and definable selective independent families. As a result, we…

逻辑 · 数学 2022-02-25 Jeffrey Bergfalk , Vera Fischer , Corey Bacal Switzer

We present a modification to the Prikry on Extenders forcing notion allowing the blow up of the power set of a large cardinal, change its cofinality to omega without adding bounded subsets, working directly from arbitrary extender (e.g.,…

逻辑 · 数学 2007-05-23 Carmi Merimovich

Assuming 0# does not exist, we present a combinatorial approach to Jensen's method of coding by a real. The forcing uses combinatorial consequences of fine structure (including the Covering Lemma, in various guises), but makes no direct…

逻辑 · 数学 2009-09-25 Saharon Shelah , Lee Stanley

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

逻辑 · 数学 2018-10-26 John Krueger

We prove that it is consistent that every two disjoint boldface $\mathbf{\Sigma}^1_1$ subsets of $\omega_1^{\omega_1}$ can be separated by a boldface $\mathbf{\Delta}^1_1$ set. The forcing starts from $L$ and preserves CH and therefore also…

逻辑 · 数学 2026-05-21 Stefan Hoffelner

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

逻辑 · 数学 2024-03-19 David Asperó , Sean Cox , Asaf Karagila , Christoph Weiss

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 show: There are pairs of universes V_1 subseteq V_2 and there is a notion of forcing P in V_1 such that the change mentioned in the title occurs when going from V_1[G] to V_2[G] for a P-generic filter G over V_2. We use forcing…

逻辑 · 数学 2007-05-23 Heike Mildenberger , Saharon Shelah

We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{\omega_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable…

逻辑 · 数学 2023-01-03 Mohammad Golshani , Haim Horowitz , Saharon Shelah

While maximal independent families can be constructed from ZFC via Zorn's lemma, the presence of a maximal $\sigma$-independent family already gives an inner model with a measurable cardinal, and Kunen has shown that from a measurable…

逻辑 · 数学 2024-08-20 Calliope Ryan-Smith

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

逻辑 · 数学 2024-03-15 Andreas Lietz

We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.

逻辑 · 数学 2014-06-13 John Krueger