Countably decomposable admissible sets

Menachem Magidor*, Saharon Shelah, Jonathan Stavi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

The known results about Σ1-completeness, Σ1-compactness, ordinal omitting etc. are given a unified treatment, which yields many new examples. It is shown that the unifying theorem is best possible in several ways, assuming V = L.

Original languageEnglish
Pages (from-to)287-361
Number of pages75
JournalAnnals of Pure and Applied Logic
Volume26
Issue number3
DOIs
StatePublished - Jun 1984

Fingerprint

Dive into the research topics of 'Countably decomposable admissible sets'. Together they form a unique fingerprint.

Cite this