English
Related papers

Related papers: On $\omega_3$-chains in P($\omega_1$) mod finite

200 papers

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…

Logic · Mathematics 2024-10-24 Miguel A. Cardona , Diego A. Mejía , Andrés F. Uribe-Zapata

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

The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…

Logic · Mathematics 2009-09-25 Chaz Schlindwein

We introduce a forcing that adds a $\square(\aleph_2,\aleph_0)$-sequence with countable conditions under CH. Assuming the consistency of a weakly compact cardinal, we can find a forcing extension by our new poset in which both…

Logic · Mathematics 2026-03-17 Maxwell Levine

Using a finite support iteration of ccc forcings, we construct a model of $\aleph_1<\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{b}<\mathrm{non}(\mathcal{M})<\mathrm{cov}(\mathcal{M})=\mathfrak{c}$.

Logic · Mathematics 2016-07-07 Martin Goldstern , Diego A. Mejía , Saharon Shelah

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…

Logic · Mathematics 2007-05-23 Michael C. Laskowski , Saharon Shelah

Answering a question of Harrington, we show that there exists a proper forcing notion, which adds a minimal real $\eta \in \prod_{i<\omega} n^*_i$, which is eventually different from any old real in $\prod_{i<\omega} n^*_i$, where the…

Logic · Mathematics 2023-01-06 Mohammad Golshani , Saharon Shelah

We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…

Logic · Mathematics 2011-10-18 Jakob Kellner , Saharon Shelah

We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…

Logic · Mathematics 2023-02-13 Joerg Brendle

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

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…

Logic in Computer Science · Computer Science 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

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

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

Logic · Mathematics 2018-11-14 James Cummings , Mirna Džamonja , Itay Neeman

We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…

Logic · Mathematics 2025-09-03 Jorge Antonio Cruz Chapital , Osvaldo Guzman , Stevo Todorcevic

Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…

Logic · Mathematics 2009-09-25 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 prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…

Logic · Mathematics 2025-04-16 Gunter Fuchs , Corey Bacal Switzer

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…

Logic · Mathematics 2021-09-24 Mohammad Golshani

In 2018 Liuquan Wang and Yifan Yang proved the existence of an infinite family of congruences for the smallest parts function corresponding to the third order mock theta function $\omega(q)$. Their proof took the form of an induction…

Number Theory · Mathematics 2020-05-25 Nicolas Allen Smoot

We present a new partial order for directly forcing morasses to exist that enjoys a significant homogeneity property. We then use this forcing in a reverse Easton iteration to obtain an extension universe with morasses at every regular…

Logic · Mathematics 2012-02-28 Andrew D. Brooke-Taylor , Sy-David Friedman