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