Elementary chains and \(C ^{(n)}\)-cardinals

DOI10.1007/s00153-013-0357-4zbMath1305.03040OpenAlexW2099202455MaRDI QIDQ2436618

Konstantinos Tsaprounis

Publication date: 25 February 2014

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-013-0357-4

zbMATH Keywords

Woodin cardinalsstrongly compact cardinals\(C^{(n)}\)-cardinals

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55)

Related Items (8)

IDENTITY CRISIS BETWEEN SUPERCOMPACTNESS AND VǑPENKA’S PRINCIPLE ⋮ Model theoretic characterizations of large cardinals ⋮ STEEL’S PROGRAMME: EVIDENTIAL FRAMEWORK, THE CORE AND ULTIMATE-L ⋮ Reflecting measures ⋮ Ultrahuge cardinals ⋮ ON C⁽ⁿ⁾-EXTENDIBLE CARDINALS ⋮ ON RESURRECTION AXIOMS ⋮ On extensions of supercompactness

Cites Work

• Unnamed Item
• On extendible cardinals and the GCH
• \(C ^{(n)}\)-cardinals
• Iterated Forcing and Elementary Embeddings
• A Proof of Projective Determinacy
• A Model in Which GCH Holds at Successors but Fails at Limits
• Canonical seeds and Prikry trees
• Tall cardinals
• Superstrong and other large cardinals are never Laver indestructible

This page was built for publication: Elementary chains and \(C ^{(n)}\)-cardinals