A criterion for completeness of degrees of unsolvability
From MaRDI portal
Publication:3243262
DOI10.2307/2964177zbMATH Open0078.00602OpenAlexW2060075008MaRDI QIDQ3243262FDOQ3243262
Publication date: 1957
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2964177
Cites Work
Cited In (29)
- Minimal Covers and Arithmetical Sets
- On trees without hyperimmune branches
- On complete degrees
- Fixed points of jump preserving automorphisms of degrees
- A non-inversion theorem for the jump operator
- Recursive Enumerability and the Jump Operator
- Weakly Represented Families in Reverse Mathematics
- On the strength of Ramsey's theorem
- A reducibility related to being hyperimmune-free
- Ivan Soskov: a life in computability
- Inverting the Half-Jump
- Completely mitotic c.e. degrees and non-jump inversion
- Turing Jumps Through Provability
- The rhombus classes of degrees of unsolvability. I. The jump properties
- Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy
- HTP-COMPLETE RINGS OF RATIONAL NUMBERS
- The Complexity of Orbits of Computably Enumerable Sets
- Two Theorems on Truth Table Degrees
- Title not available (Why is that?)
- Recursively enumerable sets and degrees
- On the structure of the Wadge degrees of bqo-valued Borel functions
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
- The weakness of being cohesive, thin or free in reverse mathematics
- On the uniform computational content of computability theory
- Defining totality in the enumeration degrees
- Untersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der Rekursiven Unlösbarkeit
- Index sets in 0'
- Sets of Formulas Valid in Finite Structures
- About Segment Complexity of Turing Reductions
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)
