A characterization of strongly computable finite factorization domains

DOI10.1007/S00153-024-00941-6MaRDI QIDQ7026081zbMATH OpenFDO

Authors Geraldo Soto-Rosa, Victor Ocasio González

Publication date 18 February 2025

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00153-024-00941-6

zbMATH Keywords

computabilitycomputable normsfinite factorization domains

Mathematics Subject Classification ID

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)

Cites work

• An introduction to computable model theory on groups and fields
• Bounded and finite factorization domains
• Computable fields and Galois theory
• Computable Structure Theory
• Effective procedures in field theory
• Finite factorization domains
• scientific article; zbMATH DE number 1970438 (Why is no real title available?)
• Irreducibles and Primes in Computable Integral Domains
• The complexity of primes in computable unique factorization domains
• The Diophantine equation \(x^2 - Dy^2 = N\), \(D>0\)
• Turing computability. Theory and applications

This page was built for publication: A characterization of strongly computable finite factorization domains

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