Initial segments of ▵12n + 1-degrees

Journal of Symbolic Logic 53 (1):259 - 268 (1988)
  Copy   BIBTEX

Abstract

A standard result about hyperdegrees is proved (under PD) for all ▵ 1 2n + 1 -degrees

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

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

On initial segments of hyperdegrees.S. K. Thomason - 1970 - Journal of Symbolic Logic 35 (2):189-197.
Definability and initial segments of c-degrees.Robert S. Lubarsky - 1988 - Journal of Symbolic Logic 53 (4):1070-1081.
A theorem on initial segments of degrees.S. K. Thomason - 1970 - Journal of Symbolic Logic 35 (1):41-45.
Initial segments of degrees below 0'.Richard L. Epstein - 1981 - Providence, R.I.: American Mathematical Society.
Countable initial segments of the degrees of unsolvability.A. H. Lachlan & R. Lebeuf - 1976 - Journal of Symbolic Logic 41 (2):289-300.
Initial segments of the lattice of ideals of R.e. Degrees.Frank P. Weber - 1994 - Journal of Symbolic Logic 59 (4):1326-1350.
Local initial segments of the Turing degrees.Bjørn Kjos-Hanssen - 2003 - Bulletin of Symbolic Logic 9 (1):26-36.

Analytics

Added to PP
2009-01-28

Downloads
14 (#846,545)

6 months
1 (#1,040,386)

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

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.

Add more references