2 citations · 2 across the 1 of their papers we have counts for
2 papers
math.LO2020
Milliken's tree theorem and its applications: a computability-theoretic perspective
Paul-Elliot Anglès d'Auriac, Peter A. Cholak, Damir D. Dzhafarov +2
Milliken's tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey's theorem and its many variants and co…
math.LO2019★ 2 cited
A comparison of various analytic choice principles
Paul-Elliot Anglès d'Auriac, Takayuki Kihara
We investigate computability theoretic and descriptive set theoretic contents of various kinds of analytic choice principles by performing detailed analysis of the Medvedev lattice…