Extension of Embeddings in the Computably Enumerable Degrees

@inproceedings{Slaman2004ExtensionOE,
  title={Extension of Embeddings in the Computably Enumerable Degrees},
  author={Theodore A. Slaman and Robert I. Soare},
  year={2004}
}
Gödel’s Incompleteness Theorem [Göd31] and his subsequent work on computable functions [Göd34] exhibited undecidability in the most familiar mathematical settings, even in elementary number theory. Following Gödel, there has been an intensive study of noncomputable sets arising in ordinary mathematics. The computably enumerable (c.e.) sets (those which can be listed by a computable method) are of particular interest because they appear naturally in most branches of mathematics and there is a… CONTINUE READING
8 Citations
14 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 14 references

On the unsolvability of the problem of reducibility in the theory of algorithms

  • A. A. Muchnik
  • Dokl. Akad. Nauk SSSR, N. S. 108:194–197
  • 1956
Highly Influential
4 Excerpts

Springer–Verlag

  • Robert I. Soare. Recursively Enumerable Sets, Degrees. Perspectives in Mathematical Logic, Omega Series
  • Heidelberg,
  • 1987
2 Excerpts

editors

  • P. A. Fejer, Richard A. Shore. Embeddings, extensions of embeddings in the r. e. tt-, wtt-degrees. In H.-D. Ebbinghaus, G. H. Muller, Gerald E. Sacks
  • Recursion Theory Week, pages 121–140, Heidelberg,
  • 1985

Ludwig-Maximillians-Universitẗ München

  • Klaus Ambos-Spies. On the Structure of the Recursively E thesis
  • Munich,
  • 1980
2 Excerpts

Logic

  • Alistair H. Lachlan. A recursively enumerable degree which Math
  • 9:307–365,
  • 1975
1 Excerpt

3)

  • Alistair H. Lachlan. Lower bounds for pairs of recursively Soc
  • 16:537–569,
  • 1966

The undecidable

  • M. Davis
  • Basic papers on undecidable propositions…
  • 1965

Ann

  • Gerald E. Sacks. The recursively enumerable degrees are dense
  • of Math., 80:300–312,
  • 1964
1 Excerpt

Similar Papers

Loading similar papers…