AN APPLICATION OF RECURSION THEORY TO ANALYSIS
From MaRDI portal
Publication:3386607
DOI10.1017/bsl.2020.19zbMath1477.03173OpenAlexW3034242323MaRDI QIDQ3386607
Publication date: 5 January 2021
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/bsl.2020.19
Descriptive set theory (03E15) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Van Lambalgen's theorem and high degrees
- Higher Kurtz randomness
- Can ideals without ccc be interesting?
- The \(\sigma\)-algebra generated by the Jordan sets in \({\mathbb{R}}^ n\)
- Approximation of analytic by Borel sets and definable countable chain conditions
- Recursion theory. Computational aspects of definability
- Algorithmic Randomness and Complexity
- A New Proof of Friedman's Conjecture
- Hierarchies of number-theoretic predicates
- Hyperarithmetical quantifiers
- Note on the Kondo-Addison theorem
- Proof of a Conjecture of Friedman
- Some applications of the notions of forcing and generic sets
- Degrees of unsolvability of constructible sets of integers
- The fine structure of the constructible hierarchy
