Minimal degrees of unsolvability and the full approximation construction / Richard L. Epstein.
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 existenc...
Full description
Saved in: