Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon.
Saved in:
Superior document: | Memoirs of the American Mathematical Society ; Volume 265, Number 1284 |
---|---|
VerfasserIn: | |
TeilnehmendeR: | |
Place / Publishing House: | Providence, Rhode Island : : American Mathematical Society,, 2020. |
Year of Publication: | 2020 |
Language: | English |
Series: | Memoirs of the American Mathematical Society ;
Volume 265, Number 1284. |
Online Access: | |
Physical Description: | 1 online resource (104 pages). |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Hierarchy of Turing Degrees : : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / / Noam Greenberg, Rod Downey.
by: Downey, Rod,
Published: ([2020]) -
The role of true finiteness in the admissible recursively enumerable degrees / / Noam Greenberg.
by: Greenberg, Noam,
Published: ([2006]) -
Minimal degrees of unsolvability and the full approximation construction / / Richard L. Epstein.
by: Epstein, Richard L.,
Published: ([1975]) -
Automorphisms of the lattice of recursively enumerable sets / / Peter Cholak.
by: Cholak, Peter,
Published: (1995.) -
Degree spectra of relations on a cone / / Matthew Harrison-Trainor.
by: Harrison-Trainor, Matthew,
Published: ([2018])