Hierarchies of Effective Descriptive Set Theory
From MaRDI portal
Publication:5585409
DOI10.2307/1995348zbMath0191.30503MaRDI QIDQ5585409
Publication date: 1969
Full work available at URL: https://doi.org/10.2307/1995348
Related Items
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, A comparison of the indices arising in the transfinite iteration of functions, Representability in some systems of second order arithmetic
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item