A criterion for completeness of degrees of unsolvability

DOI10.2307/2964177zbMath0078.00602OpenAlexW2060075008MaRDI QIDQ3243262

Richard M. Friedberg

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

zbMATH Keywords

PhilosophyFoundationsMathematical Logic

Related Items (28)

Untersuchungen über die Struktur des Kleene-Postschen Halbverbandes der Grade der Rekursiven Unlösbarkeit ⋮ On complete degrees ⋮ HTP-COMPLETE RINGS OF RATIONAL NUMBERS ⋮ A non-inversion theorem for the jump operator ⋮ Turing Jumps Through Provability ⋮ On the strength of Ramsey's theorem ⋮ Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy ⋮ On the uniform computational content of computability theory ⋮ Weakly Represented Families in Reverse Mathematics ⋮ Minimal Covers and Arithmetical Sets ⋮ Inverting the Half-Jump ⋮ On the structure of the Wadge degrees of bqo-valued Borel functions ⋮ The Complexity of Orbits of Computably Enumerable Sets ⋮ 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 ⋮ Completely mitotic c.e. degrees and non-jump inversion ⋮ Defining totality in the enumeration degrees ⋮ Index sets in 0' ⋮ Fixed points of jump preserving automorphisms of degrees ⋮ Unnamed Item ⋮ About Segment Complexity of Turing Reductions ⋮ Recursive Enumerability and the Jump Operator ⋮ Recursively enumerable sets and degrees ⋮ Two Theorems on Truth Table Degrees ⋮ On trees without hyperimmune branches ⋮ Sets of Formulas Valid in Finite Structures ⋮ A reducibility related to being hyperimmune-free ⋮ The rhombus classes of degrees of unsolvability. I. The jump properties

Cites Work

• The upper semi-lattice of degrees of recursive unsolvability

This page was built for publication: A criterion for completeness of degrees of unsolvability