Elementary chains and C ^(n)-cardinals
From MaRDI portal
Publication:2436618
DOI10.1007/S00153-013-0357-4zbMATH Open1305.03040OpenAlexW2099202455MaRDI QIDQ2436618FDOQ2436618
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
Cites Work
- Title not available (Why is that?)
- Iterated Forcing and Elementary Embeddings
- On extendible cardinals and the GCH
- A Model in Which GCH Holds at Successors but Fails at Limits
- Canonical seeds and Prikry trees
- Tall cardinals
- A Proof of Projective Determinacy
- \(C ^{(n)}\)-cardinals
- Superstrong and other large cardinals are never Laver indestructible
Cited In (12)
- An Institution-independent Generalization of Tarski's Elementary Chain Theorem
- ON RESURRECTION AXIOMS
- Model theoretic characterizations of large cardinals
- STEEL’S PROGRAMME: EVIDENTIAL FRAMEWORK, THE CORE AND ULTIMATE-L
- Chains of end elementary extensions of models of set theory
- ON C(n)-EXTENDIBLE CARDINALS
- Axiom \(\mathcal{A}\) and supercompactness
- Ultrahuge cardinals
- On extensions of supercompactness
- IDENTITY CRISIS BETWEEN SUPERCOMPACTNESS AND VǑPENKA’S PRINCIPLE
- Title not available (Why is that?)
- Reflecting measures
This page was built for publication: Elementary chains and \(C ^{(n)}\)-cardinals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436618)