Hierarchies of Effective Descriptive Set Theory
From MaRDI portal
Publication:5585409
Cites work
- scientific article; zbMATH DE number 3216177 (Why is no real title available?)
- scientific article; zbMATH DE number 3231082 (Why is no real title available?)
- scientific article; zbMATH DE number 3316891 (Why is no real title available?)
- scientific article; zbMATH DE number 3018766 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A Note on Function Quantification
- Abstract First Order Computability. I
- Degrees of Unsolvability. (AM-55)
- Hierarchies of number-theoretic predicates
- Hyperanalytic Predicates
- Memoir on the Analytical Operations and Projective Sets (I)
- Recursive Functionals and Quantifiers of Finite Types I
- Separation principles in the hierarchies of classical and effective descriptive set theory
Cited in
(6)- On the logical and computational properties of the Vitali covering theorem
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Measure-theoretic uniformity and the Suslin functional
- Modal functions for concise definition of state machines and products
- Representability in some systems of second order arithmetic
- A comparison of the indices arising in the transfinite iteration of functions
This page was built for publication: Hierarchies of Effective Descriptive Set Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5585409)
