Σ1 compactness for next admissible sets

Journal of Symbolic Logic 39 (1):105 - 116 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,219

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
53 (#411,417)

6 months
20 (#148,041)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Countably decomposable admissible sets.Menachem Magidor, Saharon Shelah & Jonathan Stavi - 1984 - Annals of Pure and Applied Logic 26 (3):287-361.
The limits of E-recursive enumerability.Gerald E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87-120.
The limits of "E"-recursive enumerability.G. E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87.

Add more citations

References found in this work

Implicit Definability and Compactness in Infinitary Languages.Jon Barwise - 1968 - Lecture Notes in Mathematics 72 (1):1--35.

Add more references