46 citations · 47 across the 5 of their papers we have counts for
5 papers · 1 filter
Effectiveness and strong graph indivisibility
Damir D. Dzhafarov, Reed Solomon, Andrea Volpi
A relational structure is \emph{strongly indivisible} if for every partition , the induced substructure on or is isomorphic to . Camero…
On the first-order parts of problems in the Weihrauch degrees
Damir D. Dzhafarov, Reed Solomon, Keita Yokoyama
We introduce the notion of the \emph{first-order part} of a problem in the Weihrauch degrees. Informally, the first-order part of a problem is the strongest problem wi…
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…
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…