A criterion for completeness of degrees of unsolvability
From MaRDI portal
Publication:3243262
Cited in
(31)- A non-inversion theorem for the jump operator
- Index sets in 0'
- Fixed points of jump preserving automorphisms of degrees
- The rhombus classes of degrees of unsolvability. I. The jump properties
- On the uniform computational content of computability theory
- Completely mitotic c.e. degrees and non-jump inversion
- On the strength of Ramsey's theorem
- Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy
- On trees without hyperimmune branches
- A reducibility related to being hyperimmune-free
- Weakly represented families in reverse mathematics
- Turing Jumps Through Provability
- Inverting the Half-Jump
- Two Theorems on Truth Table Degrees
- Recursively enumerable sets and degrees
- Sets of Formulas Valid in Finite Structures
- A Galois connection between Turing jumps and limits
- About Segment Complexity of Turing Reductions
- The weakness of being cohesive, thin or free in reverse mathematics
- HTP-COMPLETE RINGS OF RATIONAL NUMBERS
- On the structure of the Wadge degrees of bqo-valued Borel functions
- The Complexity of Orbits of Computably Enumerable Sets
- Untersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der Rekursiven Unlösbarkeit
- On complete degrees
- Minimal Covers and Arithmetical Sets
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
- Recursive Enumerability and the Jump Operator
- Defining totality in the enumeration degrees
- Ivan Soskov: a life in computability
- Almost zero and high -Turing degrees
- Weak jumps in the elementary degrees and jump inversion theorems
This page was built for publication: A criterion for completeness of degrees of unsolvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3243262)
