Post's problem without admissibility

DOI10.1016/0001-8708(80)90042-0zbMath0453.03046OpenAlexW2002453609MaRDI QIDQ1148898

Sy-David Friedman

Publication date: 1980

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0001-8708(80)90042-0

zbMATH Keywords

diamondstationary setsadmissible and inadmissible ordinalsbeta recursively enumerable degreesbeta-recursion

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Set theory (03E99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (3)

An introduction to γ-recursion theory (or what to do in KP – Foundation) ⋮ The ordertype of β-R.E. sets ⋮ Computational processes, observers and Turing incompleteness

Cites Work

• Unnamed Item
• Unnamed Item
• Aspects of constructibility
• Σ_n sets which are Δ_n-incomparable (uniformly)
• Inadmissible recursion theory
• Post's Problem, Admissible Ordinals, and Regularity
• Metarecursive sets
• The fine structure of the constructible hierarchy
• The α-finite injury method

This page was built for publication: Post's problem without admissibility