3 citations · 5 across the 4 of their papers we have counts for
3 papers · 1 filter
Carlson-Simpson's lemma and applications in reverse mathematics
Paul-Elliot Anglès d'Auriac, Bastien Mignoty, Lu Liu +1
We study the reverse mathematics of infinitary extensions of the Hales-Jewett theorem, due to Carlson and Simpson. These theorems have multiple applications in Ramsey's theory, suc…
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…
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…