Post's problem without admissibility

DOI10.1016/0001-8708(80)90042-0zbMATH Open0453.03046OpenAlexW2002453609MaRDI QIDQ1148898FDOQ1148898

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

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

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)