Tight stationarity and tree-like scales

DOI10.1016/J.APAL.2015.05.004MaRDI QIDQ2352256zbMATH OpenOpenAlexFDO

Authors William Chen

Publication date 30 June 2015

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.2015.05.004

zbMATH Keywords

mutual stationaritypcf theorytight structuretree-like scale

Mathematics Subject Classification ID

Ordered sets and their cofinalities; pcf theory (03E04) Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55)

Recommendations

• ON SINGULAR STATIONARITY II (TIGHT STATIONARITY AND EXTENDERS-BASED METHODS)
• On singular stationarity. I: Mutual stationarity and ideal-based methods
• On the relationship between mutual and tight stationarity
• Diamond, scales and GCH down to \(\aleph_{\omega^2}\)
• Continuous tree-like scales

Cites work

• Canonical structure in the universe of set theory. I
• Canonical structure in the universe of set theory. II.
• Continuous tree-like scales
• Diagonal Prikry extensions
• scientific article; zbMATH DE number 734993 (Why is no real title available?)
• scientific article; zbMATH DE number 1795296 (Why is no real title available?)
• Mutually stationary sequences of sets and the non-saturation of the non-stationary ideal on \(P_x(\lambda)\)
• On SCH and the approachability property
• On the singular cardinals problem. I
• Organic and tight
• Squares, scales and stationary reflection
• The PCF conjecture and large cardinals

Cited in

(6)

• On the relationship between mutual and tight stationarity
• ON SINGULAR STATIONARITY II (TIGHT STATIONARITY AND EXTENDERS-BASED METHODS)
• Sigma-Prikry forcing II: Iteration Scheme
• On skinny stationary subsets of
• Morasses, semimorasses and supercompact ultrafilters
• Continuous tree-like scales

This page was built for publication: Tight stationarity and tree-like scales

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352256)