English
Related papers

Related papers: Sheva-Sheva-Sheva: Large Creatures

200 papers

The two parallel concepts of "small" sets of the real line are meagre sets and null sets. Those are equivalent to Cohen forcing and Random real forcing for $\aleph^{\aleph_0}_0$; in spite of this similarity, the Cohen forcing and Random…

Logic · Mathematics 2023-08-24 Shani Cohen , Saharon Shelah

Assume $\lambda$ is a singular limit of $\eta$ supercompact cardinals, where $\eta \leq \lambda$ is a limit ordinal. We present two forcing methods for making $\lambda^+$ the successor of the limit of the first $\eta$ measurable cardinals…

Logic · Mathematics 2016-10-19 Mohammad Golshani

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

We show that there are proper forcings based upon countable trees of creatures that specialize a given Aronszajn tree.

Logic · Mathematics 2007-05-23 Heike Mildenberger , Saharon Shelah

We show that some cardinal arithmetic configurations related to the negation of the Shelah Weak Hypothesis and natural from the forcing point of view are impossible.

Logic · Mathematics 2007-05-23 Moti Gitik , Saharon Shelah

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…

Logic · Mathematics 2017-05-16 Andrzej Roslanowski , Saharon Shelah

We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…

Logic · Mathematics 2013-01-03 Andrzej Roslanowski , Saharon Shelah

Consider $(\kappa^{+++},\kappa^{++}) \twoheadrightarrow (\kappa^+,\kappa)$ where $\kappa$ is an uncountable regular cardinal. By a result of Shelah's we have $\operatorname{cof}(X \cap \kappa^{++}) = \kappa$ for almost all $X \subset…

Logic · Mathematics 2020-03-26 Dominik Adolf

We study sheaves in the context of a duality theory for lattice structure endowed with extra operations, and in the context of forcing in a topos. Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem…

Logic · Mathematics 2018-11-06 Trek Sayed Ahmed

In the paper we probe the possibilities of creating a Kurepa tree in a generic extension of a model of CH plus no Kurepa trees by an omega_1-preserving forcing notion of size at most omega_1. In the first section we show that in the Levy…

Logic · Mathematics 2016-09-06 Renling Jin , Saharon Shelah

An introduction is given to the logic of sheaves of structures and to set theoretic forcing constructions based on this logic. Using these tools, it is presented an alternative proof of the independence of the Continuum Hypothesis; which…

Logic · Mathematics 2012-02-08 J. Benavides

We show that it is consistent with MA + the negation of CH, that the Forcing Axiom fails for all forcing notions in the class of omega^omega-bounding forcing notions with norms of "Norms on possibilities I: forcing with trees and…

Logic · Mathematics 2013-01-04 Tomek Bartoszynski , Andrzej Roslanowski

For $f,g\in\omega^\omega$ let $c^\forall_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e., for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. Let…

Logic · Mathematics 2012-01-04 Jakob Kellner , Saharon Shelah

Ramsey theory and forcing have a symbiotic relationship. At the RIMS Symposium on Infinite Combinatorics and Forcing Theory in 2016, the author gave three tutorials on Ramsey theory in forcing. The first two tutorials concentrated on…

Logic · Mathematics 2020-04-27 Natasha Dobrinen

We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…

Logic in Computer Science · Computer Science 2011-11-15 Alex Spelten , Wolfgang Thomas , Sarah Winter

We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…

Logic · Mathematics 2019-08-15 Chris Lambie-Hanson , Assaf Rinot

Shelah showed that the existence of free subsets over internally approachable subalgebras follows from the failure of the PCF conjecture on intervals of regular cardinals. We show that a stronger property called the Approachable Bounded…

Logic · Mathematics 2021-02-01 Dominik Adolf , Omer Ben-Neria

We show that Shelah cardinals are preserved under the canonical $GCH$ forcing notion. We also show that if $GCH$ holds and $F:REG\rightarrow CARD$ is an Easton function which satisfies some weak properties, then there exists a cofinality…

Logic · Mathematics 2016-09-28 Mohammad Golshani

This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…

Logic · Mathematics 2020-09-10 Natasha Dobrinen

We show that generalized eventually narrow sequences on a strongly inaccessible cardinal $\kappa$ are preserved under the Cummings-Shaleh non-linear iterations of the higher Hechler forcing on $\kappa$. Moreover assuming GCH,…

Logic · Mathematics 2020-05-25 Ömer Faruk Bağ , Vera Fischer