Some applications of mixed support iterations

DOI10.1016/j.apal.2008.09.024zbMath1161.03028OpenAlexW2022770727MaRDI QIDQ1011754

John Krueger

Publication date: 9 April 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.09.024

zbMATH Keywords

disjoint stationary sequenceinternal approachabilitymixed support forcing iteration

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05)

Related Items

A general Mitchell style iteration, FORCING AXIOMS, APPROACHABILITY, AND STATIONARY SET REFLECTION, A note on the eightfold way

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Aronszajn trees on \(\aleph_2\) and \(\aleph_3\).
• Combinatorial problems on trees: partitions, \(\Delta\)-systems and large free subtrees
• Reflecting stationary sets and successors of singular cardinals
• On the size of closed unbounded sets
• The tree property
• Canonical structure in the universe of set theory. I
• Large cardinals and definable counterexamples to the continuum hypothesis
• Internally club and approachable
• Representing Sets of Ordinals as Countable Unions of Sets in the Core Model
• INTERNAL APPROACHABILITY AND REFLECTION
• Co-stationarity of the ground model
• Thin stationary sets and disjoint club sequences
• Internally club and approachable for larger structures
• A general Mitchell style iteration
• Approachability at the second successor of a singular cardinal
• Forcing closed unbounded sets
• Nonsplitting subset of _κ(κ⁺)
• A new Löwenheim-Skolem theorem
• Aronszajn trees and the independence of the transfer property