Degrees of unsolvability: structure and theory

zbMATH Open0418.03032MaRDI QIDQ755574FDOQ755574

Authors: Richard L. Epstein 

Publication date: 1979

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (14)

• Bounded query classes and the difference hierarchy
• Complementing below recursively enumerable degrees
• A survey of results on the d.c.e. and \(n\)-c.e. degrees
• Computably enumerable Turing degrees and the meet property
• Extensions of embeddings below computably enumerable degrees
• Turing computability: structural theory
• Some properties of an algebra of all sets of naturals e-reducible to a fixed set
• Lower bounds on degrees of game-theoretic structures
• A low and a high hierarchy within NP
• A splitting theorem for \(n\)-REA degrees
• Initial segments of the degrees of size \(\aleph _ 1\)
• The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
• The jump is definable in the structure of the degrees of unsolvability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q755574)