10 citations · 68 across the 40 of their papers we have counts for
4 papers · 1 filter
The reverse mathematics of Carlson's theorem for located words
Tristan Bompard, Lu Liu, Ludovic Patey
In this article, we give two proofs of Carlson's theorem for located words in~. The first proof is purely combinatorial, in the style of Towsner's proof of Hindma…
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…
The Reverse Mathematics of CAC for trees
Julien Cervelle, William Gaudelier, Ludovic Patey
CAC for trees is the statement asserting that any infinite subtree of has an infinite path or an infinite antichain. In this paper, we study the computat…
Partition genericity and pigeonhole basis theorems
Benoit Monin, Ludovic Patey
There exist two notions of typicality in computability theory, namely, genericity and randomness. In this article, we introduce a new notion of genericity, called partition generic…