4 citations · 4 across the 2 of their papers we have counts for
2 papers
math.LO2026
The weakness of typicality
Eric P. Astor, Laurent Bienvenu, Damir Dzhafarov +4
Many statements studied in reverse mathematics can be seen as mathematical problems, formulated in terms of instances and solutions. We develop a framework of typicality encompassi…
math.LO2013★ 4 cited
Computing K-Trivial Sets by Incomplete Random Sets
Laurent Bienvenu, Adam R. Day, Noam Greenberg +4
Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Martin-Löf random set that does not compute 0'.