Countably decomposable admissible sets

DOI10.1016/0168-0072(84)90006-XMaRDI QIDQ762060zbMATH OpenFDO

Authors Menachem Magidor, S. Shelah, Jonathan Stavi

Publication date 1984

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

zbMATH Keywords

compactnessdecomposabilitydefinabilityadmissible structureinfinitary languagesAdmissible ordinals

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 444448
• Models of long sentences. I
• New Computational Paradigms
• scientific article; zbMATH DE number 1420850
• Strong \(\Delta_1\)-definability of a model in an admissible set

Cites work

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

Cited in

(4)

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

This page was built for publication: Countably decomposable admissible sets

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