The pure part of HYP(M)

Journal of Symbolic Logic 42 (1):33-46 (1977)
Let M be a structure for a language L on a set M of urelements. HYP(M) is the least admissible set above M. In § 1 we show that pp(HYP(M)) [ = the collection of pure sets in HYP(M] is determined in a simple way by the ordinal α = ⚬(HYP(M)) and the $\mathscr{L}_{\propto\omega}$ theory of M up to quantifier rank α. In § 2 we consider the question of which pure countable admissible sets are of the form pp(HYP(M)) for some M and show that all sets L α (α admissible) are of this form. Other positive and negative results on this question are obtained
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2272316
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,305
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Mark Nadel (1974). Scott Sentences and Admissible Sets. Annals of Mathematical Logic 7 (2-3):267-294.

Add more references

Citations of this work BETA
Sy D. Friedman (1982). Steel Forcing and Barwise Compactness. Annals of Mathematical Logic 22 (1):31-46.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

2 ( #742,024 of 1,932,594 )

Recent downloads (6 months)

1 ( #456,397 of 1,932,594 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.