Countably decomposable admissible sets
From MaRDI portal
Publication:762060
DOI10.1016/0168-0072(84)90006-XzbMATH Open0558.03017MaRDI QIDQ762060FDOQ762060
Authors: Menachem Magidor, S. Shelah, Jonathan Stavi
Publication date: 1984
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- The fine structure of the constructible hierarchy
- Title not available (Why is that?)
- Title not available (Why is that?)
- A partition calculus in set theory
- Title not available (Why is that?)
- Aspects of constructibility
- On the standard part of nonstandard models of set theory
- Hanf numbers for fragments of L\(_{\infty \omega}\)
- Uncountable admissibles. II: Compactness
- The Suslin-Kleene theorem for \(V_\kappa\) with cofinality(\(\kappa)=\omega\).
- Uncountable Admissibles I: Forcing
- Generalizing Vaught sentences from ω to strong cofinality ω
- On partitions into stationary sets
- Strict-Π11 predicates on countable and cofinality ω transitive sets
- Uniform inductive definability and infinitary languages
- Σ1 compactness for next admissible sets
- On the Semantics of the Constructible Levels
- Structures elementarily equivalent relative to infinitary languages to models of higher power
Cited In (4)
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)