Countably decomposable admissible sets

Menachem Magidor; Saharon Shelah; Jonathan Stavi

doi:10.1016/0168-0072(84)90006-X

Countably decomposable admissible sets

Menachem Magidor^*
, Saharon Shelah
, Jonathan Stavi

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

The known results about Σ₁-completeness, Σ₁-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 language	English
Pages (from-to)	287-361
Number of pages	75
Journal	Annals of Pure and Applied Logic
Volume	26
Issue number	3
DOIs	https://doi.org/10.1016/0168-0072(84)90006-X
State	Published - Jun 1984

Access to Document

10.1016/0168-0072(84)90006-X

Cite this

@article{e0def4b29f084b939c95bc612a7e779f,

title = "Countably decomposable admissible sets",

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.",

author = "Menachem Magidor and Saharon Shelah and Jonathan Stavi",

year = "1984",

month = jun,

doi = "10.1016/0168-0072(84)90006-X",

language = "אנגלית",

volume = "26",

pages = "287--361",

journal = "Annals of Pure and Applied Logic",

issn = "0168-0072",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Countably decomposable admissible sets

AU - Magidor, Menachem

AU - Shelah, Saharon

AU - Stavi, Jonathan

PY - 1984/6

Y1 - 1984/6

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/48549114057

U2 - 10.1016/0168-0072(84)90006-X

DO - 10.1016/0168-0072(84)90006-X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:48549114057

SN - 0168-0072

VL - 26

SP - 287

EP - 361

JO - Annals of Pure and Applied Logic

JF - Annals of Pure and Applied Logic

IS - 3

ER -

Countably decomposable admissible sets

Abstract

Access to Document

Other files and links

Fingerprint

Cite this