The natural hierarchy and quasi-hierarchy of constructibility degrees

Journal of Symbolic Logic 51 (1):130-134 (1986)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,369

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
37 (#434,255)

6 months
12 (#221,514)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references