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: 91,628

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

Local initial segments of the Turing degrees.Bjørn Kjos-Hanssen - 2003 - Bulletin of Symbolic Logic 9 (1):26-36.
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.
The structure of the honest polynomial m-degrees.Rod Downey, William Gasarch & Michael Moses - 1994 - Annals of Pure and Applied Logic 70 (2):113-139.
Initial segments of the degrees of unsolvability part II: Minimal degrees.C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (2):243-266.
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.
Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Mathematical Logic Quarterly 14 (30):457-472.
Interpreting true arithmetic in the theory of the r.e. truth table degrees.André Nies & Richard A. Shore - 1995 - Annals of Pure and Applied Logic 75 (3):269-311.
Initial segments of the lattice of ideals of R.e. Degrees.Frank P. Weber - 1994 - Journal of Symbolic Logic 59 (4):1326-1350.
Countable initial segments of the degrees of unsolvability.A. H. Lachlan & R. Lebeuf - 1976 - Journal of Symbolic Logic 41 (2):289-300.
Undecidability and initial segments of the (r.E.) TT-Degrees.Christine Ann Haught & Richard A. Shore - 1990 - Journal of Symbolic Logic 55 (3):987-1006.
Some nondistributive lattices as initial segments of the degrees of unsolvability.Manuel Lerman - 1969 - Journal of Symbolic Logic 34 (1):85-98.
Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (30):457-472.
Lattice nonembeddings and initial segments of the recursively enumerable degrees.Rod Downey - 1990 - Annals of Pure and Applied Logic 49 (2):97-119.

Analytics

Added to PP
2016-06-30

Downloads
7 (#1,381,358)

6 months
2 (#1,185,463)

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