The complexity of primes in computable unique factorization domains

DOI10.1215/00294527-2017-0024zbMath1400.03061arXiv1407.2626OpenAlexW1937825932MaRDI QIDQ1750293

Joseph R. Mileti, Damir D. Dzhafarov

Publication date: 18 May 2018

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

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

zbMATH Keywords

primescomputability theorycomputable unique factorization domains

Mathematics Subject Classification ID

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

Related Items (1)

Irreducibles and Primes in Computable Integral Domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Euclidean functions of computable Euclidean domains
• Countable algebra and set existence axioms
• Basic algorithms for rational function fields
• Ideals in computable rings
• On the complexity of radicals in noncommutative rings
• Effective procedures in field theory
• Effective content of field theory
• Rekursive Algebren mit Kettenbedingungen
• Advanced Topics in Computional Number Theory
• Algorithms for Function Fields
• Computable Algebra, General Theory and Theory of Computable Fields

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