The natural hierarchy and quasi-hierarchy of constructibility degrees

Journal of Symbolic Logic 51 (1):130-134 (1986)
We investigate the set S 2 of "quickly sharped" reals: \begin{align*}S_2 &= \{x \mid x \in M, M \text{the} <^\ast-\text{least mouse} \not\in L\lbrack x\rbrack\} \\ &= \{x \mid L\lbrack x\rbrack \models "V = K"\},\\ \end{align*} in the manner of [K] defining a natural hierarchy and quasi-hierarchy of constructibility degrees and identifying their termination points
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273949
 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: 16,667
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

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Roman Frigg (2006). The Ergodic Hierarchy, Randomness and Hamiltonian Chaos. Studies in History and Philosophy of Science Part B 37 (4):661-691.

Monthly downloads

Added to index


Total downloads

5 ( #386,469 of 1,727,171 )

Recent downloads (6 months)

2 ( #264,055 of 1,727,171 )

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.