46 citations · 46 across the 3 of their papers we have counts for
3 papers
math.LO2014★ 46 cited
Lowness notions, measure and domination
Bjørn Kjos-Hanssen, Joseph S. Miller, Reed Solomon
We show that positive measure domination implies uniform almost everywhere domination and that this proof translates into a proof in the subsystem WWKL (but not in RCA) of…
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.LO2010
Reverse mathematics and infinite traceable graphs
Peter Cholak, David Galvin, Reed Solomon
This paper falls within the general program of investigating the proof theoretic strength (in terms of reverse mathematics) of combinatorial principals which follow from versions o…