On the notational independence of various hierarchies of degrees of unsolvability

DOI10.2307/2270584zbMath0137.00903OpenAlexW2096897514MaRDI QIDQ5509684

Hilary Putnam, G. Hensel

Publication date: 1965

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

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

zbMATH Keywords

mathematical logic

Related Items (2)

A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy ⋮ Uniform upper bounds on ideals of turing degrees

Cites Work

• On degrees of recursive unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• Hierarchies of number-theoretic predicates
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• The constructive second number class
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• Recursively enumerable sets of positive integers and their decision problems

This page was built for publication: On the notational independence of various hierarchies of degrees of unsolvability