14 citations · 17 across the 3 of their papers we have counts for
3 papers
math.LO2014★ 3 cited
Finding paths through narrow and wide trees
Stephen Binns, Bjørn Kjos-Hanssen
We consider two axioms of second-order arithmetic. These axioms assert, in two different ways, that infinite but narrow binary trees always have infinite paths. We show that both a…
math.LO2014
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…
math.LO2014★ 14 cited
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…