Countably decomposable admissible sets

, &
Annals of Pure and Applied Logic 26 (3):287-361 (1984)
  Copy   BIBTEX

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

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(84)90006-x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Σ1-separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374 - 382.
Covering analytic sets by families of closed sets.Sławomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.
Patterns of projecta.Adam Krawczyk - 1981 - Journal of Symbolic Logic 46 (2):287-295.
Reflection and forcing in E-recursion theory.Theodore A. Slaman - 1985 - Annals of Pure and Applied Logic 29 (1):79-106.
A strong boundedness theorem for dilators.A. S. Kechris & W. H. Woodin - 1991 - Annals of Pure and Applied Logic 52 (1-2):93-97.
∑1 definitions with parameters.T. A. Slaman - 1986 - Journal of Symbolic Logic 51 (2):453-461.
Menachem Magidor and Jerome Malitz. Compact extensions of L . Annals of mathematical logic, vol. 11 , pp. 217–261. - Matt Kaufmann. A new omitting types theorem for L. The journal of symbolic logic, vol. 44 , pp. 507–521. [REVIEW]Kim Bruce - 1985 - Journal of Symbolic Logic 50 (4):1076-1078.
J. A. Makowsky, Saharon Shelah, and Jonathan Stavi. ⊿-logics and generalized quantifiers. Annals of mathematical logic, vol. 10 , pp. 155–192. [REVIEW]Jouko Väänänen - 1985 - Journal of Symbolic Logic 50 (1):241-242.
A characterization of Σ 1 1 -reflecting ordinals.J. P. Aguilera - 2021 - Annals of Pure and Applied Logic 172 (10):103009.
Generic absoluteness.Joan Bagaria & Sy D. Friedman - 2001 - Annals of Pure and Applied Logic 108 (1-3):3-13.

Analytics

Added to PP
2014-01-16

Downloads
26 (#599,290)

6 months
8 (#505,340)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A parallel to the null ideal for inaccessible $$\lambda $$ λ : Part I.Saharon Shelah - 2017 - Archive for Mathematical Logic 56 (3-4):319-383.

Add more citations

References found in this work

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Countable models of set theories.Harvey Friedman - 1973 - In A. R. D. Mathias & Hartley Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York,: Springer Verlag. pp. 539--573.
Hanf Numbers for Fragments of L ∞ω.Jon Barwise & Kenneth Kunen - 1984 - Journal of Symbolic Logic 49 (1):315-315.
On the Semantics of the Constructible Levels.George Boolos - 1970 - Mathematical Logic Quarterly 16 (2):139-148.
On partitions into stationary sets.Karel Prikry & Robert M. Solovay - 1975 - Journal of Symbolic Logic 40 (1):75-80.

View all 9 references / Add more references