14 citations · 14 across the 3 of their papers we have counts for
3 papers
Self-embeddings of computable trees
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman +2
We divide the class of infinite computable trees into three types. For the first and second types, computes a nontrivial self-embedding while for the third type computes…
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman +1
The notions of almost everywhere (a.e.) domination and its uniform version were introduced and studied in reverse mathematics. This paper studies these notions from a recursion-the…
Separating principles below Ramsey's Theorem for Pairs
Manuel Lerman, Reed Solomon, Henry Towsner
In recent years, there has been a substantial amount of work in reverse mathematics concerning natural mathematical principles that are provable from $\RT$, Ramsey's Theorem for Pa…