English
Related papers

Related papers: Template iterations with non-definable ccc forcing…

200 papers

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

Logic · Mathematics 2013-06-25 Saharon Shelah

Cicho\'n's diagram describes the connections between combinatorial notions related to measure, category, and compactness of sets of irrational numbers. In the second part of the 2010's, Goldstern, Kellner and Shelah constructed a forcing…

Logic · Mathematics 2026-04-01 Diego A. Mejía

Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to…

Logic · Mathematics 2016-09-06 Saharon Shelah , Lee Stanley

Assume ZFC. Let $\kappa$ be a cardinal. A ${<\kappa}$-ground is a transitive proper class $W$ modelling ZFC and such that $V$ is a generic extension of $W$ via a forcing $\mathbb{P}\in W$ of cardinality ${<\kappa}$. The $\kappa$-mantle is…

Logic · Mathematics 2020-12-22 Farmer Schlutzenberg

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

For infinite cardinals $\kappa,\lambda$ let $C(\kappa,\lambda)$ denote the class of all compact Hausdorff spaces of weight $\kappa$ and size $\lambda$. So $C(\kappa,\lambda)=\emptyset$ if $\kappa>\lambda$ or $\lambda>2^\kappa$. If F is a…

General Topology · Mathematics 2025-12-17 Gerald Kuba

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

Logic · Mathematics 2016-09-07 Ernest Schimmerling , John R. Steel

We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…

Logic · Mathematics 2026-04-02 Tom Benhamou , James Cummings , Gabriel Goldberg , Yair Hayut , Alejandro Poveda

We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…

Logic · Mathematics 2024-01-30 Chris Lambie-Hanson , Assaf Rinot , Jing Zhang

Relative to class many supercompact cardinals, we construct a model of $\ZFC+\GCH$ where for every singular cardinal $\delta$ of countable cofinality and every regular uncountable $\mu<\delta$ there are stationarily many non-approachable…

Logic · Mathematics 2026-04-27 Hannes Jakob

In Mathias forcing, conditions are pairs $(D,S)$ of sets of natural numbers, in which $D$ is finite, $S$ is infinite, and $\max D < \min S$. The Turing degrees and computational characteristics of generics for this forcing in the special…

Logic · Mathematics 2016-07-07 Peter A. Cholak , Damir D. Dzhafarov , Mariya I. Soskova

While maximal independent families can be constructed from ZFC via Zorn's lemma, the presence of a maximal $\sigma$-independent family already gives an inner model with a measurable cardinal, and Kunen has shown that from a measurable…

Logic · Mathematics 2024-08-20 Calliope Ryan-Smith

This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…

Logic · Mathematics 2007-05-23 Saharon Shelah

We give a detailed proof of the properties of the usual Prikry type forcing notion for turning a measurable cardinal into $\aleph_\omega$.

Logic · Mathematics 2019-02-20 Mohammad Golshani

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

Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a kappa-like model where kappa is an inaccessible cardinal.…

Logic · Mathematics 2010-06-22 Shahram Mohsenipour

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

Logic · Mathematics 2007-05-23 Bernhard Koenig

We investigate a notion called uniqueness in power kappa that is akin to categoricity in power kappa, but is based on the cardinality of the generating sets of models instead of on the cardinality of their universes. The notion is quite…

Logic · Mathematics 2016-09-06 Steven Givant , Saharon Shelah

Assuming that there is no inner model with a Woodin cardinal, we obtain a characterization of $\lambda$-tall cardinals in extender models that are iterable. In particular we prove that in such extender models, a cardinal $\kappa$ is a tall…

Logic · Mathematics 2021-04-13 Gabriel Fernandes , Ralf Schindler

We provide a proof, in $ZFC$, of Shelah's eventual categoricity conjecture for abstract elementary classes (AEC's). Moreover, assuming in addition the Singular Cardinal Hypothesis ($SCH$), we prove a direct generalization to the more…

Logic · Mathematics 2022-04-14 Christian Espíndola