Computability theory and degree structures
This thesis mainly studies the thin-free degrees. We show the technique to construct a thin-free degree, and construct a hyperimmune-free minimal thin-free degrees below 0'', and a nonbranching thin-free r.e. degree. We also show that any 1-generic degree below 0' is not thin-free, wh...
Saved in:
Main Author: | Yuan, Bowen |
---|---|
Other Authors: | Wu Guohua |
Format: | Thesis-Doctor of Philosophy |
Language: | English |
Published: |
Nanyang Technological University
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/139815 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Cupping in the computably enumerable degrees
by: Tran, Hong Hanh
Published: (2023) -
Contributions to degree structures
by: Wang, Shenling
Published: (2011) -
Members of thin π⁰₁ classes and generic degrees
by: Stephan, Frank, et al.
Published: (2022) -
Degree structures below 0'
by: Liu, Jiang
Published: (2010) -
Splitting into degrees with low computational strength
by: Downey, Rod, et al.
Published: (2020)