Mass problems and density
From MaRDI portal
Publication:2951897
DOI10.1142/S0219061316500069zbMath1401.03075MaRDI QIDQ2951897
Stephen Binns, Richard A. Shore, Stephen G. Simpson
Publication date: 10 January 2017
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
Turing jumpTuring degreesMuchnik degreesmass problemsdegrees of unsolvabilityhyperarithmetical theoryTuring oracles
Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)
Related Items (1)
Cites Work
- Degrees of Unsolvability: A Tutorial
- MASS PROBLEMS AND HYPERARITHMETICITY
- A recursively enumerable degree which will not split over all lesser ones
- A splitting theorem for the Medvedev and Muchnik lattices
- On the existence of a strong minimal pair
- Degrees of Unsolvability. (AM-55)
- Systems of Logic Based on Ordinals†
- Recursively enumerable sets of positive integers and their decision problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Mass problems and density
