An application of recursion theory to analysis
DOI10.1017/BSL.2020.19zbMATH Open1477.03173OpenAlexW3034242323MaRDI QIDQ3386607FDOQ3386607
Authors: Liang Yu
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
Recommendations
Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Descriptive set theory (03E15) 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)
Cites Work
- Algorithmic randomness and complexity.
- Computability and randomness
- The fine structure of the constructible hierarchy
- Some applications of the notions of forcing and generic sets
- Title not available (Why is that?)
- Hyperarithmetical quantifiers
- Title not available (Why is that?)
- Approximation of analytic by Borel sets and definable countable chain conditions
- Van Lambalgen's theorem and high degrees
- Hierarchies of number-theoretic predicates
- Higher Kurtz randomness
- Degrees of unsolvability of constructible sets of integers
- Can ideals without ccc be interesting?
- The \(\sigma\)-algebra generated by the Jordan sets in \({\mathbb{R}}^ n\)
- Recursion theory. Computational aspects of definability
- A new proof of Friedman's conjecture
- Title not available (Why is that?)
- Note on the Kondo-Addison theorem
- Proof of a Conjecture of Friedman
Cited In (3)
This page was built for publication: An application of recursion theory to analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386607)