English
Related papers

Related papers: Measuring club sequences, together with the Contin…

200 papers

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 present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…

Logic · Mathematics 2016-06-10 John Krueger

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

Based on works of Saharon Shelah, Jakob Kellner, and Anda T\u{a}nasie for controlling the cardinal characteristics of the continuum in ccc forcing extensions, in the author's master's thesis was introduced a new combinatorial notion: the…

Logic · Mathematics 2024-02-09 Andrés F. Uribe-Zapata

We investigate iterating the construction of $C^{*}$, the $L$-like inner model constructed using first order logic augmented with the "cofinality $\omega$" quantifier. We first show that $\left(C^{*}\right)^{C^{*}}=C^{*}\ne L$ is…

Logic · Mathematics 2021-09-14 Ur Ya'ar

We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…

Logic · Mathematics 2021-12-21 Sittinon Jirattikansakul

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…

General Topology · Mathematics 2013-10-22 Marion Scheepers

We show that that a certain class of semi-proper iterations does not add omega-sequences. As a result, starting from suitable large cardinals one can obtain a model in which the Continuum Hypothesis holds and every function from omega_1 to…

Logic · Mathematics 2010-09-02 Paul Larson , Saharon Shelah

Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…

Logic · Mathematics 2022-10-11 Joel David Hamkins

We reimplement the creature forcing construction used by Fischer et al. (arXiv:1402.0367) to separate Cicho\'{n}'s diagram into five cardinals as a countable support product. Using the fact that it is of countable support, we augment our…

Logic · Mathematics 2021-04-07 Martin Goldstern , Lukas Daniel Klausner

We characterize the situation of having many normal measures on a measurable cardinal. We show the plausibility of having many normal measures on each compact cardinal.

Logic · Mathematics 2016-02-10 Shimon Garti

We show that from a supercompact cardinal \kappa, there is a forcing extension V[G] that has a symmetric inner model N in which ZF + not AC holds, \kappa\ and \kappa^+ are both singular, and the continuum function at \kappa\ can be…

Logic · Mathematics 2016-02-10 Arthur W. Apter , Brent Cody

Using the proof-program (Curry-Howard) correspondence, we give a new method to obtain models of ZF and relative consistency results in set theory. We show the relative consistency of ZF + DC + there exists a sequence of subsets of R the…

Logic · Mathematics 2015-07-01 Jean-Louis Krivine

We present different extensions of the Banach contraction principle in the $G$-metric space setting. More precisely, we consider mappings for which the contractive condition is satisfied by a power of the mapping and for which the power…

General Topology · Mathematics 2017-04-04 Yaé Olatoundji Gaba

All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…

General Mathematics · Mathematics 2025-05-28 Stanislav Semenov

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

Logic · Mathematics 2024-08-21 Noah Schweber

Given a Woodin cardinal $\delta$, I show that if $F$ is any Easton function with $F"\delta\subseteq\delta$ and $\GCH$ holds, then there is a cofinality-preserving forcing extension in which $2^\gamma= F(\gamma)$ for each regular cardinal…

Logic · Mathematics 2012-09-07 Brent Cody

Let GCH hold and let $j:V\longrightarrow M$ be a definable elementary embedding such that $crit(j)=\kappa$, $^{\kappa}M\subseteq M$ and $\kappa^{++}=\kappa_{M}^{++}$. H. Woodin proved that there is a cofinality preserving generic extension…

Logic · Mathematics 2017-06-27 Yoav Ben Shalom

The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…

Logic · Mathematics 2026-03-16 Curial Gallart

We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…

Logic · Mathematics 2019-01-18 P. D. Welch