Measure and cupping in the Turing degrees
From MaRDI portal
Publication:2845877
DOI10.1090/S0002-9939-2012-11183-9zbMath1294.03031OpenAlexW2038238641MaRDI QIDQ2845877
Andrew E. M. Lewis, George Barmpalias
Publication date: 3 September 2013
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-2012-11183-9
Cites Work
- On degrees of recursive unsolvability
- Jump inversions inside effectively closed sets and applications to randomness
- Algorithmic Randomness and Complexity
- A 1-generic degree with a strong minimal cover
- A random degree with strong minimal cover
- Π10 classes, strong minimal covers and hyperimmune-free degrees
- Degrees of Unsolvability. (AM-55)
- The definition of random sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Measure and cupping in the Turing degrees