Irreducibles and Primes in Computable Integral Domains

DOI10.1007/978-3-319-50062-1_17zbMath1485.03175arXiv1407.5882OpenAlexW2963227315MaRDI QIDQ2970963

Leigh Evron, Ethan Ratliff-Crain, Joseph R. Mileti

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.5882

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Factorization in integral domains
• Factorization in integral domains. II
• The complexity of primes in computable unique factorization domains
• Effective procedures in field theory
• Effective content of field theory
• Finite factorization domains
• Computable Algebra, General Theory and Theory of Computable Fields

This page was built for publication: Irreducibles and Primes in Computable Integral Domains