The Embedding Problem for the Recursively Enumerable Degrees

In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--13 (1985)
  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: 101,337

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

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.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
Incomparable prime ideals of recursively enumerable degrees.William C. Calhoun - 1993 - Annals of Pure and Applied Logic 63 (1):39-56.
Major subsets and automorphisms of recursively enumerable sets.Wolfgang Maass - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 21.
Major subsets and the lattice of recursively enumerable sets.Michael Stob - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 107.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2006 - Providence, R.I.: American Mathematical Society.
Recursively Enumerable Equivalence Relations Modulo Finite Differences.André Nies - 1994 - Mathematical Logic Quarterly 40 (4):490-518.
Embeddings into the recursively enumerable degreesi.Nsf Grant Dms92 - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, enumerability, unsolvability: directions in recursion theory. New York: Cambridge University Press. pp. 185.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Recursively Enumerable Degrees and the Conjugacy Problem.Donald J. Collins - 1970 - Journal of Symbolic Logic 35 (3):477-477.

Analytics

Added to PP
2014-01-31

Downloads
14 (#1,276,532)

6 months
1 (#1,886,949)

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