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