scholarly journals ON SINGULAR STATIONARITY II (TIGHT STATIONARITY AND EXTENDERS-BASED METHODS)

2019 ◽  
Vol 84 (1) ◽  
pp. 320-342
Author(s):  
OMER BEN-NERIA
Keyword(s):  
Generic Extension ◽  
Ground Model ◽  
Regular Cardinals ◽  
Consistency Results ◽  
Image Position ◽  
Model Sequence

AbstractWe study the notion of tightly stationary sets which was introduced by Foreman and Magidor in [8]. We obtain two consistency results showing that certain sequences of regular cardinals ${\langle {\kappa _n}\rangle _{n < \omega }}$ can have the property that in some generic extension, every ground-model sequence of fixed-cofinality stationary sets ${S_n} \subseteq {\kappa _n}$ is tightly stationary. The results are obtained using variations of the short-extenders forcing method.

scholarly journals ITERATING SYMMETRIC EXTENSIONS

2019 ◽  
Vol 84 (1) ◽  
pp. 123-159 ◽  
Author(s):  
ASAF KARAGILA
Keyword(s):  
Axiom Of Choice ◽  
Generic Extension ◽  
Ground Model ◽  
Intermediate Model ◽  
Symmetric Extension ◽  
Consistency Results ◽  
New Models ◽  
Image Position ◽  
The Axiom Of Choice

AbstractThe notion of a symmetric extension extends the usual notion of forcing by identifying a particular class of names which forms an intermediate model of $ZF$ between the ground model and the generic extension, and often the axiom of choice fails in these models. Symmetric extensions are generally used to prove choiceless consistency results. We develop a framework for iterating symmetric extensions in order to construct new models of $ZF$. We show how to obtain some well-known and lesser-known results using this framework. Specifically, we discuss Kinna–Wagner principles and obtain some results related to their failure.

scholarly journals COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS

2016 ◽  
Vol 81 (3) ◽  
pp. 814-832 ◽  
Author(s):  
JULIA KNIGHT ◽  
ANTONIO MONTALBÁN ◽  
NOAH SCHWEBER
Keyword(s):  
Positive Result ◽  
Generic Extension ◽  
Ground Model ◽  
Rigid Structure ◽  
Basic Properties ◽  
Image Position ◽  
Scott Rank ◽  
The Universe ◽  
Generic Extensions ◽  
Countable Structure

AbstractIn this paper, we investigate connections between structures present in every generic extension of the universe V and computability theory. We introduce the notion of generic Muchnik reducibility that can be used to compare the complexity of uncountable structures; we establish basic properties of this reducibility, and study it in the context of generic presentability, the existence of a copy of the structure in every extension by a given forcing. We show that every forcing notion making ω2 countable generically presents some countable structure with no copy in the ground model; and that every structure generically presentable by a forcing notion that does not make ω2 countable has a copy in the ground model. We also show that any countable structure ${\cal A}$ that is generically presentable by a forcing notion not collapsing ω1 has a countable copy in V, as does any structure ${\cal B}$ generically Muchnik reducible to a structure ${\cal A}$ of cardinality ℵ1. The former positive result yields a new proof of Harrington’s result that counterexamples to Vaught’s conjecture have models of power ℵ1 with Scott rank arbitrarily high below ω2. Finally, we show that a rigid structure with copies in all generic extensions by a given forcing has a copy already in the ground model.

-definability at uncountable regular cardinals

2012 ◽  
Vol 77 (3) ◽  
pp. 1011-1046 ◽  
Author(s):  
Philipp Lücke
Keyword(s):  
Partial Order ◽  
Regular Cardinal ◽  
Short Proof ◽  
Chain Condition ◽  
Generic Extension ◽  
Infinite Cardinal ◽  
Ground Model ◽  
Generic Absoluteness ◽  
Regular Cardinals ◽  
Quasi Order

AbstractLet κ be an infinite cardinal. A subset of (κκ)n is a -subset if it is the projection p[T] of all cofinal branches through a subtree T of (>κκ)n+1 of height κ. We define and -subsets of (κκ)n as usual.Given an uncountable regular cardinal κ with κ = κ<κ and an arbitrary subset A of κκ, we show that there is a <κ-closed forcing ℙ that satisfies the κ+-chain condition and forces A to be a -subset of κκ in every ℙ-generic extension of V. We give some applications of this result and the methods used in its proof.(i) Given any set x, we produce a partial order with the above properties that forces x to be an element of L.(ii) We show that there is a partial order with the above properties forcing the existence of a well-ordering of κκ whose graph is a -subset of κκ × κκ.(iii) We provide a short proof of a result due to Mekler and Väänänen by using the above forcing to add a tree T of cardinality and height κ such that T has no cofinal branches and every tree from the ground model of cardinality and height κ without a cofinal branch quasi-order embeds into T.(iv) We will show that generic absoluteness for -formulae (i.e., formulae with parameters which define -subsets of κκ) under <κ-closed forcings that satisfy the κ+-chain condition is inconsistent.In another direction, we use methods from the proofs of the above results to show that - and -subsets have some useful structural properties in certain ZFC-models.

The consistency of the axiom of universality for the ordering of cardinalities

1985 ◽  
Vol 50 (2) ◽  
pp. 502-509
Author(s):  
Marco Forti ◽  
Furio Honsell
Keyword(s):  
Set Theory ◽  
Partially Ordered Set ◽  
Regular Cardinal ◽  
Ordered Set ◽  
Partial Ordering ◽  
Generic Extension ◽  
Ground Model ◽  
Partially Ordered ◽  
Transfer Method ◽  
Image Position

T. Jech [4] and M. Takahashi [7] proved that given any partial ordering R in a model of ZFC there is a symmetric submodel of a generic extension of where R is isomorphic to the injective ordering on a set of cardinals.The authors raised the question whether the injective ordering of cardinals can be universal, i.e. whether the following axiom of “cardinal universality” is consistent:CU. For any partially ordered set (X, ≼) there is a bijection f:X → Y such that(i.e. x ≼ y iff ∃g: f(x) → f(y) injective). (See [1].)The consistency of CU relative to ZF0 (Zermelo-Fraenkel set theory without foundation) is proved in [2], but the transfer method of Jech-Sochor-Pincus cannot be applied to obtain consistency with full ZF (including foundation), since CU apparently is not boundable.In this paper the authors define a model of ZF + CU as a symmetric submodel of a generic extension obtained by forcing “à la Easton” with a class of conditions which add κ generic subsets to any regular cardinal κ of a ground model satisfying ZF + V = L.

scholarly journals ON THE SPLITTING NUMBER AT REGULAR CARDINALS

2015 ◽  
Vol 80 (4) ◽  
pp. 1348-1360 ◽  
Author(s):  
OMER BEN-NERIA ◽  
MOTI GITIK
Keyword(s):  
Core Model ◽  
Generic Extension ◽  
Singular Cardinal ◽  
Ground Model ◽  
The Core ◽  
Regular Cardinals ◽  
Splitting Number ◽  
Uncountable Cardinals

AbstractLetκ, λ be regular uncountable cardinals such that λ >κ+is not a successor of a singular cardinal of low cofinality. We construct a generic extension withs(κ) = λ starting from a ground model in whicho(κ) = λ and prove that assuming ¬0¶,s(κ) = λ implies thato(κ) ≥ λ in the core model.

Constructible lattices of c-degrees

1982 ◽  
Vol 47 (4) ◽  
pp. 739-754
Author(s):  
C.P. Farrington
Keyword(s):  
Set Theory ◽  
Regular Cardinal ◽  
Boolean Algebras ◽  
Combinatorial Complexity ◽  
Generic Extension ◽  
Transitive Model ◽  
Perfect Set ◽  
Consistency Results ◽  
Combinatorial Principles ◽  
Souslin Trees

This paper is devoted to the proof of the following theorem.Theorem. Let M be a countable standard transitive model of ZF + V = L, and let ℒ Є M be a wellfounded lattice in M, with top and bottom. Let ∣ℒ∣M = λ, and suppose κ ≥ λ is a regular cardinal in M. Then there is a generic extension N of M such that(i) N and M have the same cardinals, and κN ⊂ M;(ii) the c-degrees of sets of ordinals of N form a pattern isomorphic to ℒ;(iii) if A ⊂ On and A Є N, there is B Є P(κ+)N such that L(A) = L(B).The proof proceeds by forcing with Souslin trees, and relies heavily on techniques developed by Jech. In [5] he uses these techniques to construct simple Boolean algebras in L, and in [6] he uses them to construct a model of set theory whose c-degrees have orderlype 1 + ω*.The proof also draws on ideas of Adamovicz. In [1]–[3] she obtains consistency results concerning the possible patterns of c-degrees of sets of ordinals using perfect set forcing and symmetric models. These methods have the advantage of yielding real degrees, but involve greater combinatorial complexity, in particular the use of ‘sequential representations’ of lattices.The advantage of the approach using Souslin trees is twofold: first, we can make use of ready-made combinatorial principles which hold in L, and secondly, the notion of genericity over a Souslin tree is particularly simple.

scholarly journals Forcing with Non-wellfounded Models

2007 ◽  
Vol 5 ◽  
Author(s):  
Paul Corazza
Keyword(s):  
Set Theory ◽  
Ground Model ◽  
Iterated Forcing ◽  
Consistency Results

We develop the machinery for performing forcing over an arbitrary (possibly non-wellfounded) model of set theory. For consistency results, this machinery is unnecessary since such results can always be legitimately obtained by assuming that the ground model is (countable) transitive. However, for establishing properties of a given (possibly non-wellfounded) model, the fully developed machinery of forcing as a means to produce new related models can be useful. We develop forcing through iterated forcing, paralleling the standard steps of presentation found in [19] and [14].

scholarly journals DEFINABLE MINIMAL COLLAPSE FUNCTIONS AT ARBITRARY PROJECTIVE LEVELS

2019 ◽  
Vol 84 (1) ◽  
pp. 266-289 ◽  
Author(s):  
VLADIMIR KANOVEI ◽  
VASSILY LYUBETSKY
Keyword(s):  
Generic Extension ◽  
Image Position

AbstractUsing a nonLaver modification of Uri Abraham’s minimal $\Delta _3^1$ collapse function, we define a generic extension $L[a]$ by a real a, in which, for a given $n \ge 3$, $\left\{ a \right\}$ is a lightface $\Pi _n^1 $ singleton, a effectively codes a cofinal map $\omega \to \omega _1^L $ minimal over L, while every $\Sigma _n^1 $ set $X \subseteq \omega $ is still constructible.

scholarly journals SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS

2018 ◽  
Vol 83 (04) ◽  
pp. 1512-1538 ◽  
Author(s):  
CHRIS LAMBIE-HANSON ◽  
PHILIPP LÜCKE
Keyword(s):  
Partial Order ◽  
Set Theory ◽  
Consistency Strength ◽  
Chain Conditions ◽  
Regular Cardinals ◽  
Aronszajn Tree ◽  
Square Principles ◽  
Image Position ◽  
Aronszajn Trees ◽  
Consistency Strengths

AbstractWith the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that Todorčević’s principle $\square \left( {\kappa ,\lambda } \right)$ implies an indexed version of $\square \left( {\kappa ,\lambda } \right)$, we show that for all infinite, regular cardinals $\lambda < \kappa$, the principle $\square \left( \kappa \right)$ implies the existence of a κ-Aronszajn tree containing a λ-ascent path. We then provide a complete picture of the consistency strengths of statements relating the interactions of trees with ascent paths and special trees. As a part of this analysis, we construct a model of set theory in which ${\aleph _2}$-Aronszajn trees exist and all such trees contain ${\aleph _0}$-ascent paths. Finally, we use our techniques to show that the assumption that the κ-Knaster property is countably productive and the assumption that every κ-Knaster partial order is κ-stationarily layered both imply the failure of $\square \left( \kappa \right)$.

scholarly journals TOWERS IN FILTERS, CARDINAL INVARIANTS, AND LUZIN TYPE FAMILIES

2018 ◽  
Vol 83 (3) ◽  
pp. 1013-1062 ◽  
Author(s):  
JÖRG BRENDLE ◽  
BARNABÁS FARKAS ◽  
JONATHAN VERNER
Keyword(s):  
List Type ◽  
Type Number ◽  
Cardinal Invariants ◽  
Regular Cardinals ◽  
Image Position

AbstractWe investigate which filters onωcan contain towers, that is, a modulo finite descending sequence without any pseudointersection (in${[\omega ]^\omega }$). We prove the following results:(1)Many classical examples of nice tall filters contain no towers (in ZFC).(2)It is consistent that tall analytic P-filters contain towers of arbitrary regular height (simultaneously for many regular cardinals as well).(3)It is consistent that all towers generate nonmeager filters (this answers a question of P. Borodulin-Nadzieja and D. Chodounský), in particular (consistently) Borel filters do not contain towers.(4)The statement “Every ultrafilter contains towers.” is independent of ZFC (this improves an older result of K. Kunen, J. van Mill, and C. F. Mills).Furthermore, we study many possible logical (non)implications between the existence of towers in filters, inequalities between cardinal invariants of filters (${\rm{ad}}{{\rm{d}}^{\rm{*}}}\left( {\cal F} \right)$,${\rm{co}}{{\rm{f}}^{\rm{*}}}\left( {\cal F} \right)$,${\rm{no}}{{\rm{n}}^{\rm{*}}}\left( {\cal F} \right)$, and${\rm{co}}{{\rm{v}}^{\rm{*}}}\left( {\cal F} \right)$), and the existence of Luzin type families (of size$\ge {\omega _2}$), that is, if${\cal F}$is a filter then${\cal X} \subseteq {[\omega ]^\omega }$is an${\cal F}$-Luzin family if$\left\{ {X \in {\cal X}:|X \setminus F| = \omega } \right\}$is countable for every$F \in {\cal F}$.

Sign in / Sign up

Export Citation Format

Share Document