Minimal Degrees of Unsolvability and the Full Approximation Construction

, , &
American Mathematical Soc. (1975)
  Copy   BIBTEX

Abstract

For the purposes of this monograph, "by a degree" is meant a degree of recursive unsolvability. A degree [script bold]m is said to be minimal if 0 is the unique degree less than [script bold]m. Each of the six chapters of this self-contained monograph is devoted to the proof of an existence theorem for minimal degrees.

Categories

Keywords

Reprint years

ISBN(s)

9780821818626   0821818627

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

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

Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
Degrees of unsolvability.Joseph Robert Shoenfield - 1972 - New York,: American Elsevier.
Degrees of unsolvability: structure and theory.Richard L. Epstein - 1979 - New York: Springer Verlag.
Initial segments of the degrees of unsolvability part II: Minimal degrees.C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (2):243-266.
Degrees of unsolvability: local and global theory.Manuel Lerman - 1983 - New York: Springer Verlag.
Yates [1970], who obtained a low minimal degree as a corollary to his con.of Minimal Degrees Below - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 81.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
On Degrees of Recursive Unsolvability.Clifford Spector - 1957 - Journal of Symbolic Logic 22 (4):374-375.
Review: Clifford Spector, On Degrees of Recursive Unsolvability. [REVIEW]Martin Davis - 1957 - Journal of Symbolic Logic 22 (4):374-375.
The Upper Semi-Lattice of Degrees of Recursive Unsolvability.S. C. Kleene & Emil L. Post - 1956 - Journal of Symbolic Logic 21 (4):407-408.
Review: Gerald E. Sacks, On Suborderings of Degrees of Recursive Unsolvability. [REVIEW]Gustav B. Hensel - 1964 - Journal of Symbolic Logic 29 (4):203-203.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Review: S. C. Kleene, Emil L. Post, The Upper Semi-Lattice of Degrees of Recursive Unsolvability. [REVIEW]Hartley Rogers - 1956 - Journal of Symbolic Logic 21 (4):407-408.
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions.Martin Davis (ed.) - 1965 - Hewlett, NY, USA: Dover Publication.

Analytics

Added to PP
2015-02-02

Downloads
5 (#1,539,211)

6 months
4 (#787,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Complementing below recursively enumerable degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.
A superhigh diamond in the c.e. tt-degrees.Douglas Cenzer, Johanna Ny Franklin, Jiang Liu & Guohua Wu - 2011 - Archive for Mathematical Logic 50 (1-2):33-44.

Add more citations

References found in this work

No references found.

Add more references