\(I_0\) and combinatorics at \(\lambda ^+\)
From MaRDI portal
Publication:512141
DOI10.1007/s00153-016-0518-3zbMath1417.03270OpenAlexW2560190033MaRDI QIDQ512141
Publication date: 24 February 2017
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-016-0518-3
squarediamondaxiom \(I_0\)generic absolutenessstationary reflectionweak square\(\lambda \)-continuum hypothsis\(\lambda \)-goodness\(\lambda ^+\)-Aronszajn treegood scales
Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general tool for consistency results related to I1
- Notes on singular cardinal combinatorics
- The tree property at successors of singular cardinals
- Reflection of elementary embedding axioms on the \(L[V_{\lambda+1}\) hierarchy]
- Rank-into-rank hypotheses and the failure of GCH
- Prikry on extenders, revisited
- SQUARES, SCALES AND STATIONARY REFLECTION
- SUITABLE EXTENDER MODELS II: BEYOND ω-HUGE
- Iterated Forcing and Elementary Embeddings
- Prikry-Type Forcings
- AXIOM I0 AND HIGHER DEGREE THEORY
- The weak □* is really weaker than the full □
- Strong axioms of infinity and elementary embeddings
- Inverse limit reflection and the structure of L(Vλ+1)
- The fine structure of the constructible hierarchy
- On descendingly incomplete ultrafilters
This page was built for publication: \(I_0\) and combinatorics at \(\lambda ^+\)