Minimal degrees of unsolvability and the full approximation construction /
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...
Saved in:
Main Author: | |
---|---|
Format: | Thesis Electronic eBook |
Language: | English |
Published: |
Providence :
American Mathematical Society,
1975.
|
Series: | Memoirs of the American Mathematical Society ;
no. 162. |
Subjects: | |
Online Access: |
Full text (Wentworth users only) |
Local Note: | ProQuest Ebook Central |