Proper divisibility in computable rings
ACAACCPcomputabilitycomputable ringconstructive (effective) algebradivisibility relationintegral domainintegral domain theoryreverse mathematicsringUFDunique factorization
Foundations of classical theories (including reverse mathematics) (03B30) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Integral domains (13G05) Integral domains (associative rings and algebras) (16U10)
The authors analyze results of ring theory from the viewpoints of reverse mathematics and computability theory. Let A denote the statement: An integral domain \(R\) is a unique factorization domain if and only if every irreducible element of \(R\) is prime and the divisibility relation in \(R\) is well-founded. Let B denote the statement: If \(R\) is an integral domain with a well-founded divisibility relation then every element of \(R\) is the product of irreducible elements. The authors prove that both A and B are equivalent to \(\text{ACA}_0\) over the base system \(\text{RCA}_0\). The authors also prove the following computability theoretic bounds. There is a computable non-atomic integral domain \(R\) such that every infinite chain of proper divisibility in \(R\) computes \({\emptyset}^\prime\). There is a computable non-atomic integral domain such that \({\emptyset}^\prime\) does not compute any infinite chain of proper divisibility in \(R\). The central proof technique involves coding \(\Sigma^0_2\) binary trees into computable integral domains. Other articles on computable ring theory of the last decade include [\textit{C. J. Conidis}, Trans. Am. Math. Soc. 362, No. 12, 6523--6550 (2010; Zbl 1215.03017); \textit{R. G. Downey} and \textit{A. M. Kach}, Notre Dame J. Formal Logic 52, No. 2, 163--172 (2011; Zbl 1260.03082); \textit{R. G. Downey} et al., J. Algebra 314, No. 2, 872--887 (2007; Zbl 1127.03037); \textit{D. Dzhafarov} and \textit{J. Mileti}, ``The complexity of primes in computable UFDs, Notre Dame J. Formal Logic (to appear)].
- AP-domains and unique factorization.
- Chain conditions in computable rings
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable structures and the hyperarithmetical hierarchy
- CONSTRUCTIVE ALGEBRAS I
- Countable algebra and set existence axioms
- Effective content of field theory
- Effective procedures in field theory
- Euclidean functions of computable Euclidean domains
- scientific article; zbMATH DE number 1002913 (Why is no real title available?)
- scientific article; zbMATH DE number 3779289 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1303204 (Why is no real title available?)
- scientific article; zbMATH DE number 3805536 (Why is no real title available?)
- scientific article; zbMATH DE number 3450357 (Why is no real title available?)
- scientific article; zbMATH DE number 1390022 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3069327 (Why is no real title available?)
- Ideals in computable rings
- Iterated effective embeddings of abelian p-groups
- Jump degrees of torsion-free abelian groups
- Recursive properties of Euclidean domains
- Recursively enumerable vector spaces
- Subsystems of second order arithmetic
This page was built for publication: Proper divisibility in computable rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504325)
