55 citations · 164 across the 24 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.LO2013★ 6 cited
Coding Methods in Computability Theory and Complexity Theory
Andre Nies
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied w…
math.LO2013
Denjoy, Demuth, and Density
Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller +1
We consider effective versions of two classical theorems, the Lebesgue density theorem and the Denjoy-Young-Saks theorem. For the first, we show that a Martin-Loef random real $z\i…
math.LO2013★ 1 cited
Complexity of equivalence relations and preorders from computability theory
Egor Ianovski, Keng Meng Ng, Russell Miller +1
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations , a componentwise reducibility…