73 citations · 76 across the 3 of their papers we have counts for
Showing math.LOShow all
3 papers · 1 filter
math.LO2010★ 3 cited
Harrington's Solution to McLaughlin's Conjecture and Non-uniform Self-moduli
Peter M. Gerdes
While much work has been done to characterize the Turing degrees computing members of various collections of fast growing functions, much less has been done to characterize the rat…
math.LO2010
A ω-REA Set Forming A Minimal Pair With 0'
Peter M. Gerdes
It is easy to see that no n-REA set can form a (non-trivial) minimal pair with 0' and only slightly more difficult to observe that no ω-REA set can form a (non-trivial) minimal pai…
math.LO2010★ 73 cited
Computably Enumerable Equivalence Relations
Su Gao, Peter Gerdes
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.