Yates [1970], who obtained a low minimal degree as a corollary to his con

In S. B. Cooper, T. A. Slaman & S. S. Wainer, Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 81 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

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

The Medvedev Lattice of Degrees of Difficulty.Andrea Sorbi - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer, Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--289.
On isolating re and isolated dr. e. degrees.Steffen Lemppl & Richard A. Shore - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer, Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--61.
Embeddings into the recursively enumerable degreesi.Nsf Grant Dms92 - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer, Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 185.
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Dynamic properties of computably enumerable sets.Robert I. Soare - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer, Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--105.
On the V3-Theory of the Factor Lattice by the Major Subset Relation.Eberhard Herrmann - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer, Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 224--139.
SB Cooper, TA Slaman, and SS Wainer, eds. Computability, Enumerability, Unsolvability: Directions in Recursion Theory.R. Downey - 1997 - Journal of Logic Language and Information 6:107-109.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Computability, enumerability, unsolvability: directions in recursion theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - New York: Cambridge University Press.
Minimal Degrees of Unsolvability and the Full Approximation Construction.American Mathematical Society, Donald I. Cartwright, John Williford Duskin & Richard L. Epstein - 1975 - American Mathematical Soc..

Analytics

Added to PP
2014-01-26

Downloads
9 (#1,560,696)

6 months
2 (#1,294,541)

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