5 citations · 24 across the 9 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.LO2017★ 4 cited
Muchnik degrees and cardinal characteristics
Benoit Monin, André Nies
For let be the mass problem of infinite bit sequences~ (i.e., -valued functions) such that for each computable bit sequence , the bit s…
math.LO2017★ 1 cited
A computable analysis of variable words theorems
Lu Liu, Benoit Monin, Ludovic Patey
The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given an…