On cototality and the skip operator in the enumeration degrees
From MaRDI portal
Publication:4967303
DOI10.1090/tran/7604zbMath1457.03059OpenAlexW2799443591WikidataQ129894007 ScholiaQ129894007MaRDI QIDQ4967303
Joseph S. Miller, Rutger Kuyper, Uri Andrews, Hristo Ganchev, Steffen Lempp, Alexandra Soskova, Mariya Ivanova Soskova
Publication date: 3 July 2019
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/tran/7604
Related Items
RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ Cototal enumeration degrees and their applications to effective mathematics ⋮ A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES ⋮ PA RELATIVE TO AN ENUMERATION ORACLE ⋮ Density of the cototal enumeration degrees ⋮ Comparing the degrees of enumerability and the closed Medvedev degrees
Cites Work
- Unnamed Item
- Unnamed Item
- The bi-embeddability relation for finitely generated groups. II
- Goodness in the enumeration and singleton degrees
- Recursion theory week. Proceedings of a conference held in Oberwolfach, Germany, March 19-25, 1989
- The \(n\)-rea enumeration degrees are dense
- Hyperenumeration reducibility
- Classical recursion theory. Vol. II
- INITIAL SEGMENTS OF THE ENUMERATION DEGREES
- An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Jumps of quasi-minimal enumeration degrees
- On Quasi-Minimal e-Degrees and Total e-Degrees
- DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
- Degrees of unsolvability of continuous functions
- Enumeration reducibility and partial degrees
- Arithmetical Reducibilities I
- Defining totality in the enumeration degrees
- Logical Approaches to Computational Barriers
This page was built for publication: On cototality and the skip operator in the enumeration degrees
