Lightface ^0_3-completeness of density sets under effective Wadge reducibility

DOI10.1007/978-3-319-40189-8_24MaRDI QIDQ3188261zbMATH OpenOpenAlexFDO

Authors Gemma Carotenuto, André Nies

Publication date 17 August 2016

Published in Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-40189-8_24

Mathematics Subject Classification ID

Descriptive set theory (03E15) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• The descriptive set theory of the Lebesgue density theorem
• HANDMADE DENSITY SETS
• Density of the Medvedev lattice of ^0_1 classes
• Descriptive set-theoretical properties of an abstract density operator
• Lebesgue density and \(\Pi _1^0\) classes

Cites work

• Classical recursion theory. The theory of functions and sets of natural numbers
• Coherent randomness tests and computing the \(K\)-trivial sets
• Computability and Randomness
• Computuing \(K\)-trivial sets by incomplete random sets
• Creativeness and completeness in recursion categories of partial recursive operators
• Density, forcing, and the covering problem
• Lebesgue density and \(\Pi _1^0\) classes
• The descriptive set theory of the Lebesgue density theorem
• Using almost-everywhere theorems from analysis to study randomness

This page was built for publication: Lightface \(\varPi ^0_3\)-completeness of density sets under effective Wadge reducibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188261)