Post's problem without admissibility

DOI10.1016/0001-8708(80)90042-0MaRDI QIDQ1148898zbMATH OpenOpenAlexFDO

Authors 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

stationary setsdiamondadmissible and inadmissible ordinalsbeta recursively enumerable degreesbeta-recursion

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• scientific article; zbMATH DE number 3499732 (Why is no real title available?)
• Aspects of constructibility
• Inadmissible recursion theory
• Metarecursive sets
• Post's Problem, Admissible Ordinals, and Regularity
• The fine structure of the constructible hierarchy
• The α-finite injury method
• Σ_n sets which are Δ_n-incomparable (uniformly)

Cited in

(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

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

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