Initial segments of Δ 2n+1 1-degrees

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

Abstract

A standard result about hyperdegrees is proved for allΔ2n+11-degrees.

Categories

Keywords

Reprint years

DOI

10.1017/s002248120002908x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

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

Through your library

My notes

Similar books and articles

Initial segments of ▵12n + 1-degrees.Ilias G. Kastanas - 1988 - Journal of Symbolic Logic 53 (1):259 - 268.
Initial Segments of $triangle^1_{2n + 1}$-Degrees.Ilias G. Kastanas - 1988 - Journal of Symbolic Logic 53 (1):259-268.
A theorem on initial segments of degrees.S. K. Thomason - 1970 - Journal of Symbolic Logic 35 (1):41-45.
Local initial segments of the Turing degrees.Bjørn Kjos-Hanssen - 2003 - Bulletin of Symbolic Logic 9 (1):26-36.
Splitting properties of {$n$}-c.e. enumeration degrees.I. Sh Kalimullin - 2002 - Journal of Symbolic Logic 67 (2):537-546.
Initial segments of the degrees of unsolvability part II: Minimal degrees.C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (2):243-266.
On initial segments of hyperdegrees.S. K. Thomason - 1970 - Journal of Symbolic Logic 35 (2):189-197.
Carl G. JockuschJr., and David B. Posner. Double jumps of minimal degrees. The journal of symbolic logic, vol. 43 no. 4 , pp. 715–724. - Carl G. JockuschJr., and David B. Posner. Automorphism bases for degrees of unsotvability. Israel journal of mathematics, vol. 40 , pp. 150–164. - Richard L. Epstein. Initial segments of degrees below 0′. Memoirs of the American Mathematical Society, no. 241. American Mathematical Society, Providence1981, vi + 102 pp. - Richard A. Shore. The theory of the degrees below 0′. The journal of the London Mathematical Society, ser. 2 vol. 24 , pp. 1–14.M. Lerman - 1985 - Journal of Symbolic Logic 50 (2):550-552.
Countable initial segments of the degrees of unsolvability.A. H. Lachlan & R. Lebeuf - 1976 - Journal of Symbolic Logic 41 (2):289-300.
A note on initial segments of the enumeration degrees.Theodore A. Slaman & Andrea Sorbi - 2014 - Journal of Symbolic Logic 79 (2):633-643.

Analytics

Added to PP
2016-06-30

Downloads
7 (#1,413,139)

6 months
2 (#1,259,876)

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