An application of recursion theory to analysis

DOI10.1017/BSL.2020.19MaRDI QIDQ3386607zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

analytic setshyperarithmetic\(\sigma\)-ideaKurtz-randomness

Mathematics Subject Classification ID

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)

Recommendations

• Publication:4863331
• Borel canonization of analytic sets with Borel sections
• On the Existence and Recursion Theoretic Properties of ∑n1-Generic Sets of Reals
• Approximation of analytic by Borel sets and definable countable chain conditions
• Analytic ideals and their applications

Cites work

• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 841175 (Why is no real title available?)
• scientific article; zbMATH DE number 3250555 (Why is no real title available?)
• A new proof of Friedman's conjecture
• Algorithmic randomness and complexity.
• Approximation of analytic by Borel sets and definable countable chain conditions
• Can ideals without ccc be interesting?
• Computability and randomness
• Degrees of unsolvability of constructible sets of integers
• Hierarchies of number-theoretic predicates
• Higher Kurtz randomness
• Hyperarithmetical quantifiers
• Note on the Kondo-Addison theorem
• Proof of a Conjecture of Friedman
• Recursion theory. Computational aspects of definability
• Some applications of the notions of forcing and generic sets
• The \(\sigma\)-algebra generated by the Jordan sets in \({\mathbb{R}}^ n\)
• The fine structure of the constructible hierarchy
• Van Lambalgen's theorem and high degrees

Cited in

(3)

• Chebyshev's recursion: Analytic principles and applications
• scientific article; zbMATH DE number 3895067 (Why is no real title available?)
• scientific article; zbMATH DE number 841175 (Why is no real title available?)

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)