Characterizing the continuous degrees
From MaRDI portal
Publication:2279952
DOI10.1007/s11856-019-1943-xzbMath1442.03023OpenAlexW2986269543WikidataQ126866471 ScholiaQ126866471MaRDI QIDQ2279952
Uri Andrews, Gregory Igusa, Joseph S. Miller, Mariya Ivanova Soskova
Publication date: 17 December 2019
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-019-1943-x
Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Computation over the reals, computable analysis (03D78)
Related Items
A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES ⋮ PA RELATIVE TO AN ENUMERATION ORACLE ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ ON A METRIC GENERALIZATION OF THE tt-DEGREES AND EFFECTIVE DIMENSION THEORY ⋮ Point Degree Spectra of Represented Spaces
Cites Work
- Unnamed Item
- Uniform test of algorithmic randomness over a general space
- Randomness for non-computable measures
- Note on Degrees of Partial Functions
- Reducibility and Completeness for Sets of Integers
- DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
- Computable metrization
- Degrees of unsolvability of continuous functions
- Arithmetical Reducibilities I
- Defining totality in the enumeration degrees
- Point Degree Spectra of Represented Spaces