Countably decomposable admissible sets

DOI10.1016/0168-0072(84)90006-XzbMath0558.03017MaRDI QIDQ762060

Menachem Magidor, Saharon Shelah, Jonathan Stavi

Publication date: 1984

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

zbMATH Keywords

compactnessdefinabilitydecomposabilityadmissible structureinfinitary languagesAdmissible ordinals

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Logic on admissible sets (03C70)

Related Items

A parallel to the null ideal for inaccessible \(\lambda\). I, On co-\(\kappa\)-Souslin relations, Uncountable admissibles. II: Compactness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uncountable admissibles. II: Compactness
• Aspects of constructibility
• The Suslin-Kleene theorem for \(V_\kappa\) with cofinality(\(\kappa)=\omega\).
• Hanf numbers for fragments of L\(_{\infty \omega}\)
• A partition calculus in set theory
• On the standard part of nonstandard models of set theory
• Uncountable Admissibles I: Forcing
• Generalizing Vaught sentences from ω to strong cofinality ω
• On partitions into stationary sets
• Strict-Π₁¹ predicates on countable and cofinality ω transitive sets
• Uniform inductive definability and infinitary languages
• Σ₁ compactness for next admissible sets
• On the Semantics of the Constructible Levels
• Structures elementarily equivalent relative to infinitary languages to models of higher power
• The fine structure of the constructible hierarchy