Minimal degrees recursive in 1-generic degrees
Annals of Pure and Applied Logic
Saved in:
Main Authors: | Chong, C.T., Downey, R.G. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/103549 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
The members of thin and minimal ?<inf>1</inf>0 classes, their ranks and Turing degrees
by: Downey, Rod G., et al.
Published: (2016) -
The minimal e-degree problem in fragments of Peano arithmetic
by: Arslanov, M.M., et al.
Published: (2014) -
Members of thin π⁰₁ classes and generic degrees
by: Stephan, Frank, et al.
Published: (2022) -
High minimal pairs in the enumeration degrees
by: Sorbi, A., et al.
Published: (2014) -
Splitting into degrees with low computational strength
by: Downey, Rod, et al.
Published: (2020)