The complexity of primes in computable unique factorization domains

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Applications of logic to commutative algebra (13L05)

Abstract: In many simple integral domains, such as

m a t h b b Z

or

m a t h b b Z [i]

, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact that such a naive approach does not immediately translate to integral domains like

m a t h b b Z [x]

or the ring of integers in an algebraic number field, there still exist computational procedures that work to determine the prime elements in these cases. In contrast, we will show how to computably extend

m a t h b b Z

in such a way that we can control the ordinary integer primes in any

P i_{2}^{0}

way, all while maintaining unique factorization. As a corollary, we establish the existence of a computable UFD such that the set of primes is

P i_{2}^{0}

-complete in every computable presentation.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: The complexity of primes in computable unique factorization domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1750293)