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: 91,202

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

The pure part of HYP(M).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
HC of an admissible set.Sy D. Friedman - 1979 - Journal of Symbolic Logic 44 (1):95-102.
U-Meager sets when the cofinality and the coinitiality of U are uncountable.Bosko Zivaljevic - 1991 - Journal of Symbolic Logic 56 (3):906-914.
The Pure Part of $mathrm{HYP}(mathscr{M}$).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
Some Ramsey-type theorems for countably determined sets.Josef Mlček & Pavol Zlatoš - 2002 - Archive for Mathematical Logic 41 (7):619-630.
Anti-admissible sets.Jacob Lurie - 1999 - Journal of Symbolic Logic 64 (2):407-435.
Decomposable Ultrafilters and Possible Cofinalities.Paolo Lipparini - 2008 - Notre Dame Journal of Formal Logic 49 (3):307-312.
On countably closed complete Boolean algebras.Thomas Jech & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (4):1380-1386.
Covering analytic sets by families of closed sets.Sławomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.
Theories for admissible sets: a unifying approach to proof theory.Gerhard Jäger - 1986 - Napoli: Bibliopolis.
Admissible sets and structures: an approach to definability theory.Jon Barwise - 1975 - New York: Springer Verlag.
Admissible representations for probability measures.Matthias Schröder - 2007 - Mathematical Logic Quarterly 53 (4):431-445.
Polish group actions and effectivity.Barbara Majcher-Iwanow - 2012 - Archive for Mathematical Logic 51 (5-6):563-573.

Analytics

Added to PP
2014-01-16

Downloads
21 (#695,936)

6 months
4 (#698,851)

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 & H. 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