A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy

DOI10.2307/1995087MaRDI QIDQ5607224zbMATH OpenOpenAlexWikidataFDO

Authors Richard K. Boyd, G. Hensel, Hilary W. Putnam

Publication date 1969

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

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)

Cites work

• A minimal model for set theory
• Arithmetical Predicates and Function Quantifiers
• Consistency of the Continuum Hypothesis. (AM-3)
• Hierarchies in Recursive Function Theory
• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3139751 (Why is no real title available?)
• On the notational independence of various hierarchies of degrees of unsolvability
• Recursive well-orderings

Cited in

(4)

• Constructibility in higher order arithmetics
• The ramified analytical hierarchy using extended logics
• A disquotational theory of truth as strong as \(Z_2^-\)
• Some notes on truths and comprehension

This page was built for publication: A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy

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