Post's Problem, Admissible Ordinals, and Regularity
From MaRDI portal
Publication:5528642
DOI10.2307/1994431zbMath0149.24704OpenAlexW4240944861MaRDI QIDQ5528642
Publication date: 1966
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1994431
Related Items
Discrete Transfinite Computation ⋮ Post's problem without admissibility ⋮ The irregular and non-hyperregular \(\alpha\)-r.e. degrees ⋮ On the reducibility of \(\Pi_ 1^ 1\) sets ⋮ Maximal sets in \(\alpha\)-recursion theory ⋮ Metarecursively enumerable sets and admissible ordinals
This page was built for publication: Post's Problem, Admissible Ordinals, and Regularity