46 citations · 63 across the 10 of their papers we have counts for
3 papers · 1 filter
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…
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…