A note on the hyperarithmetical hierarchy

DOI10.2307/2270699zbMath0205.30803OpenAlexW2052854342MaRDI QIDQ5605217

Hilary Putnam, H. B. Enderton

Publication date: 1971

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2270699

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)

Related Items

Upper bounds for the arithmetical degrees, Incompleteness and jump hierarchies, Enumeration Reducibility and Computable Structure Theory, Hyperarithmetical Sets, On the First Order Theory of the Arithmetical Degrees, Effective randomness for continuous measures, A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES

Cites Work

• On degrees of recursive unsolvability
• On a problem of Kleene’s
• Unnamed Item