Degrees of unsolvability: structure and theory

zbMath0418.03032MaRDI QIDQ755574

Richard L. Epstein

Publication date: 1979

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

zbMATH Keywords

undecidabilitybibliographytextbookrecursive functionsdegrees of unsolvabilityfirst-order theory of degreeshistorical commentspartial recursive functionalspriority argumentssecond-order number theory

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (14)

Complementing below recursively enumerable degrees ⋮ THE n-r.e. DEGREES: UNDECIDABILITY AND Σ₁ SUBSTRUCTURES ⋮ The ∀∃-theory of ℛ(≤,∨,∧) is undecidable ⋮ Lower bounds on degrees of game-theoretic structures ⋮ Bounded query classes and the difference hierarchy ⋮ The jump is definable in the structure of the degrees of unsolvability ⋮ Unnamed Item ⋮ A splitting theorem for $n-REA$ degrees ⋮ A survey of results on the d.c.e. and \(n\)-c.e. degrees ⋮ Computably enumerable Turing degrees and the meet property ⋮ Turing computability: structural theory ⋮ Initial segments of the degrees of size \(\aleph _ 1\) ⋮ Extensions of embeddings below computably enumerable degrees ⋮ A low and a high hierarchy within NP

This page was built for publication: Degrees of unsolvability: structure and theory