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

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

A Hierarchy For The Plus Cupping Turing Degrees.Angsheng Li & Yong Wang - 2003 - Journal of Symbolic Logic 68 (3):972-988.
Definability of types, and pairs of o-minimal structures.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1400-1409.
A hierarchy for the plus cupping Turing degrees.Yong Wang & Angsheng Li - 2003 - Journal of Symbolic Logic 68 (3):972-988.
Normality and $\mathscr{P}(\kappa)/\mathscr{J}$.R. Zrotowski - 1991 - Journal of Symbolic Logic 56 (3):1064-1067.
Quasi‐completeness and functions without fixed‐points.Ilnur I. Batyrshin - 2006 - Mathematical Logic Quarterly 52 (6):595-601.

Analytics

Added to PP
2009-01-28

Downloads
47 (#470,645)

6 months
7 (#715,360)

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