LEBESGUE DENSITY AND CLASSES

DOI10.1017/jsl.2015.66zbMath1432.03080OpenAlexW2576534056MaRDI QIDQ2805025

Mushfeq Khan

Publication date: 9 May 2016

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2015.66

zbMATH Keywords

algorithmic randomnesseffective analysis

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Related Items (3)

Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility ⋮ Lowness, Randomness, and Computable Analysis ⋮ The random members of a \({\Pi }_{1}^{0}\) class

Cites Work

• Density, forcing, and the covering problem
• Denjoy, Demuth and density
• COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
• Cupping with random sets
• Counting the Changes of Random ${\Delta^0_2}$ Sets

This page was built for publication: LEBESGUE DENSITY AND CLASSES