Minimal degrees of unsolvability and the full approximation construction / / Richard L. Epstein.
Saved in:
Superior document: | Memoirs of the American Mathematical Society ; volume 3, issue 1, number 162 (September 1975) |
---|---|
VerfasserIn: | |
Place / Publishing House: | Providence : : American Mathematical Society,, [1975] 1975 |
Year of Publication: | 1975 |
Language: | English |
Series: | Memoirs of the American Mathematical Society ;
number 162. |
Online Access: | |
Physical Description: | 1 online resource (147 pages) :; illustrations. |
Notes: | Originally presented as the author's thesis, University of California, Berkeley. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Initial segments of degrees below 0' / / Richard L. Epstein.
by: Epstein, Richard L.,
Published: ([1981]) -
Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon.
by: Downey, R. G.
Published: (2020.) -
Classical Mathematical Logic : : The Semantic Foundations of Logic / / Richard L. Epstein.
by: Epstein, Richard L.,
Published: ([2011]) -
Degree spectra of relations on a cone / / Matthew Harrison-Trainor.
by: Harrison-Trainor, Matthew,
Published: ([2018]) -
The role of true finiteness in the admissible recursively enumerable degrees / / Noam Greenberg.
by: Greenberg, Noam,
Published: ([2006])