Hierarchies of Effective Descriptive Set Theory

DOI10.2307/1995348zbMath0191.30503OpenAlexW4247727108MaRDI QIDQ5585409

Peter G. Hinman

Publication date: 1969

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

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (5)

A comparison of the indices arising in the transfinite iteration of functions ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Modal functions for concise definition of state machines and products ⋮ Representability in some systems of second order arithmetic ⋮ Measure-theoretic uniformity and the Suslin functional

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchies of number-theoretic predicates
• A Note on Function Quantification
• Recursive Functionals and Quantifiers of Finite Types I
• Separation principles in the hierarchies of classical and effective descriptive set theory
• Memoir on the Analytical Operations and Projective Sets (I)
• Degrees of Unsolvability. (AM-55)
• Hyperanalytic Predicates
• Abstract First Order Computability. I

This page was built for publication: Hierarchies of Effective Descriptive Set Theory