35 citations · 138 across the 26 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.LO2011★ 35 cited
The hierarchy of equivalence relations on the natural numbers under computable reducibility
Samuel Coskey, Joel David Hamkins, Russell Miller
The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computab…
math.LO2011
Cardinal characteristics and countable Borel equivalence relations
Samuel Coskey, Scott Schneider
Boykin and Jackson recently introduced a property of countable Borel equivalence relations called Borel boundedness, which they showed is closely related to the union problem for h…
math.LO2011
Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
Samuel Coskey, Joel David Hamkins
We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite…