中文
相关论文

相关论文: Revised support iterations and CH

200 篇论文

In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…

逻辑 · 数学 2024-11-20 Bokai Yao

Our main theorem is about iterated forcing for making the continuum larger than aleph_2. We present a generalization of math.LO/0303294 which is dealing with oracles for random, etc., replacing aleph_1, aleph_2 by lambda,lambda^+ (starting…

逻辑 · 数学 2010-03-03 Saharon Shelah

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

逻辑 · 数学 2026-01-06 Saharon Shelah

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

逻辑 · 数学 2026-03-19 Saharon Shelah

We examine the existence (and mostly non-existence) of fresh sets in commonly used iterations of Prikry type forcing notions. Results of [4] are generalized. As an application, a question of a referee of [9] is answered. In addition…

逻辑 · 数学 2024-03-05 Moti Gitik , Eyal Kaplan

In [Sh E46], Shelah obtained a non-forking relation for an AEC, (K,\preceq), with LST-number at most \lambda, which is categorical in \lambda and \lambda^+ and has less than 2^{\lambda^+} models of cardinality \lambda^{++}, but at least…

逻辑 · 数学 2011-05-19 Adi Jarden , Saharon Shelah

We use coherent systems of FS iterations on a power set, which can be seen as matrix iteration that allows restriction on arbitrary subsets of the vertical component, to prove general theorems about preservation of certain type of unbounded…

逻辑 · 数学 2020-07-07 Diego A. Mejía

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…

Posner and Robinson (1981) proved that if $S \subseteq \omega$ is non-computable, then there exists a $G \subseteq \omega$ such that $S \oplus G \geq_T G'$. Shore and Slaman (1999) extended this result to all $n \in \omega$, by showing that…

逻辑 · 数学 2012-09-17 Adam R. Day , Damir D. Dzhafarov

Let I be a sigma-ideal sigma-generated by a projective collection of closed sets. The forcing with I-positive Borel sets is proper and adds a single real r of an almost minimal degree: if s is a real in V[r] then s is Cohen generic over V…

逻辑 · 数学 2007-05-23 Jindrich Zapletal

We develop a unified framework for iterated symmetric extensions with countable support and, more generally, with $<\kappa$-support. Set-length iterations are treated uniformly, and when the iteration template is first-order definable over…

逻辑 · 数学 2026-01-26 Frank Gilson

This paper makes contributions to ``pure'' sheaf model theory, the part of model theory in which the models are sheaves over a complete Heyting algebra. We start by outlining the theory in a way we hope is readable for the non-specialist.…

逻辑 · 数学 2026-02-10 Andreas Brunner , Charles Morgan , Darllan Conceição Pinto

This article continues Roslanowski and Shelah math.LO/9906024 and 1105.6049 We introduce here yet another property of (<lambda)-strategically complete forcing notions which implies that their lambda-support iterations do not collapse…

逻辑 · 数学 2017-05-16 Andrzej Roslanowski , Saharon Shelah

The present paper has three themes. First, we continue the investigations started in Judah, Roslanowski and Shelah \math.LO/9310224 and Roslanowski and Shelah math.LO/9807172, math.LO/9703222, and we investigate the method of norms on…

逻辑 · 数学 2013-01-04 Andrzej Roslanowski , Saharon Shelah

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

逻辑 · 数学 2024-04-24 Miloš S. Kurilić

We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…

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

A new case of Shelah's eventual categoricity conjecture is established: $\mathbf{Theorem}$ Let $K$ be an AEC with amalgamation. Write $H_2 := \beth_{\left(2^{\beth_{\left(2^{\text{LS} (K)}\right)^+}}\right)^+}$. Assume that $K$ is…

逻辑 · 数学 2018-05-07 Sebastien Vasey

I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory. Every such model $W$ has forcing extensions $W[c]$ and $W[d]$ by adding a Cohen real, which cannot…

逻辑 · 数学 2015-11-04 Joel David Hamkins

One of the better-known independence results in general mathematics is Shelah's solution to Whitehead's problem of whether $\mathrm{Ext}^1(A,\mathbb{Z})=0$ implies that an abelian group $A$ is free. The point of departure for the present…

逻辑 · 数学 2025-12-16 Jeffrey Bergfalk , Chris Lambie-Hanson , Jan Šaroch

We present two perhaps surprisingly small posets, one graded and one non-graded, that are CC-shellable in the sense of Kozlov and TCL-shellable in the sense of Hersh, but not CL-shellable in the sense of Bj\"orner and Wachs. In the spirit…

组合数学 · 数学 2025-03-31 Stephen Lacina , Grace Stadnyk