English
Related papers

Related papers: On ground model definability

200 papers

We modify the definable ultrapower construction of Kanovei and Shelah (2004) to develop a ZF-definable extension of the continuum with transfer provable using countable choice only, with an additional mild hypothesis on well-ordering…

I introduce a new family of axioms extending ZFC set theory, the $\Sigma_n$-correct forcing axioms. These assert roughly that whenever a forcing name $\dot{a}$ can be forced by a poset in some forcing class $\Gamma$ to have some $\Sigma_n$…

Logic · Mathematics 2024-05-17 Ben Goodman

Let $M$ be a tame mouse modelling ZFC. We show that $M$ satisfies "$V=\mathrm{HOD}_x$ for some real $x$", and that the restriction $\mathbb{E}\upharpoonright[\omega_1^M,\mathrm{OR}^M)$ of the extender sequence $\mathbb{E}^M$ of $M$ to…

Logic · Mathematics 2026-04-15 Farmer Schlutzenberg

We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…

Logic · Mathematics 2015-06-23 Diego Alejandro Mejía

Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…

Logic · Mathematics 2016-09-06 Garvin Melles

We generically construct a model in which the ${\Pi^1_3}$-uniformization property is true, thus lowering the best known consistency strength from the existence of $M_1^{\#}$ to just $\mathsf{ZFC}$. The forcing construction can be adapted to…

Logic · Mathematics 2022-10-18 Stefan Hoffelner

We describe a framework for proving consistency results about singular cardinals of arbitrary cofinality and their successors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular…

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

Logic · Mathematics 2011-05-16 Alexandra Shlapentokh , Carlos Videla

Let $M$ be a fine structural mouse and let $F\in M$ be such that $M\models$``$F$ is a total extender'' and $(M||\mathrm{lh}(F),F)$ is a premouse. We show that it follows that $F\in\mathbb{E}^M$, where $\mathbb{E}^M$ is the extender sequence…

Logic · Mathematics 2019-03-20 Farmer Schlutzenberg

We show that if the universe is self-iterable and $\kappa$ is an inaccessible limit of Woodin cardinal then $AD_R + "\Theta$ is regular" holds in the derived model at $\kappa$. The proof is fine-structure free, and only assumes basic…

Logic · Mathematics 2021-11-15 Grigor Sargsyan , Takehiko Gappo

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 investigate systems of transitive models of ZFC which are elementarily embeddable into each other and the influence of definability properties on such systems.

Logic · Mathematics 2021-08-30 Monroe Eskew , Sy-David Friedman , Yair Hayut , Farmer Schlutzenberg

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 prove in ZFC the existence of a definable, countably saturated elementary extension of the reals. It seems that it has been taken for granted that there is no distinguished, definable nonstandard model of the reals. (This means a…

Logic · Mathematics 2018-08-16 Vladimir Kanovei , Saharon Shelah

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

There is a model of ZF with a $\Delta^1_3$ definable Hamel basis in which $AC_\omega(R)$ fails.

Logic · Mathematics 2019-02-08 Vladimir Kanovei , Ralf Schindler

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

We answer a question of Moore by building a forcing extension satisfying measuring together with CH. The construction works over any model of ZFC and can be described as a forcing iteration with countable structures as side conditions and…

Logic · Mathematics 2011-11-14 David Asperó , Miguel Angel Mota

The manuscript is concerned with the Rudin-Keisler order of ultrafilters on measurable cardinals. The main theorem proved read as follows: Given regular cardinals $\lambda\leq \kappa$, the following theories are equiconsistent modulo ZFC:…

Logic · Mathematics 2026-01-16 Yair Hayut , Alejandro Poveda

The property of countable metacompactness of a topological space gets its importance from Dowker's 1951 theorem that the product of a normal space X with the unit interval is again normal iff X is countably metacompact. In a recent paper,…

Logic · Mathematics 2024-05-29 Rodrigo Carvalho , Tanmay Inamdar , Assaf Rinot