5 citations · 24 across the 9 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.LO2019
Bad oracles in higher computability and randomness
Laurent Bienvenu, Noam Greenberg, Benoit Monin
Many constructions in computability theory rely on "time tricks". In the higher setting, relativising to some oracles shows the necessity of these. We construct an oracle~ and a…
math.LO2019★ 4 cited
SRT22 does not imply RT22 in omega-models
Benoit Monin, Ludovic Patey
We complete a 40-year old program on the computability-theoretic analysis of Ramsey's theorem, starting with Jockusch in 1972, and improving a result of Chong, Slaman and Yang in 2…
math.LO2019★ 5 cited
The weakness of the pigeonhole principle under hyperarithmetical reductions
Benoit Monin, Ludovic Patey
The infinite pigeonhole principle for 2-partitions () asserts the existence, for every set , of an infinite subset of or of its complement. In this paper, w…