6 citations · 6 across the 1 of their papers we have counts for
3 papers
math.LO2014
Irreducibles and primes in computable integral domains
Leigh Evron, Joseph R. Mileti, Ethan Ratliff-Crain
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to dete…
math.LO2014★ 6 cited
The Complexity of Primes in Computable UFDs
Damir D. Dzhafarov, Joseph R. Mileti
In many simple integral domains, such as or , there is a straightforward procedure to determine if an element is prime by simply reducing to a direct ch…
math.LO2012
On uniform relationships between combinatorial problems
François G. Dorais, Damir D. Dzhafarov, Jeffry L. Hirst +2
The enterprise of comparing mathematical theorems according to their logical strength is an active area in mathematical logic. In this setting, called reverse mathematics, one inve…