D. Turetsky

activity

20132026

most citedComputing K-Trivial Sets by Incomplete Random Sets

4 citations · 7 across the 8 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.LO2022★ 1 cited

An Effective Classification of Borel Wadge Classes

Adam Day, Noam Greenberg, Matthew Harrison-Trainor +1

We give a new and effective classification of all Borel Wadge classes of subsets of Baire space. This relies on the true stage machinery originally developed by Montalbán. We use t…

math.LO2022★ 2 cited

Iterated Priority Arguments in Descriptive Set Theory

Adam Day, Noam Greenberg, Matthew Harrison-Trainor +1

We present the true stages machinery and illustrate its applications to descriptive set theory. We use this machinery to provide new proofs of the Hausdorff-Kuratowski and Wadge th…

math.LO2022

Limit Complexities, Minimal Descriptions, and $n$ -Randomness

Rodney Downey, Lu Liu, Keng Meng Ng +1

Let $K$ denote prefix-free Kolmogorov Complexity, and $K^{A}$ denote it relative to an oracle $A$ . We show that for any $n$ , $K^{\emptyset^{(n)}}$ is definable purely in terms of the…

An Effective Classification of Borel Wadge Classes

Iterated Priority Arguments in Descriptive Set Theory

Limit Complexities, Minimal Descriptions, and n-Randomness

Limit Complexities, Minimal Descriptions, and $n$ -Randomness