Euclidean functions of computable Euclidean domains

DOI10.1215/00294527-1306172MaRDI QIDQ540403zbMATH OpenOpenAlexFDO

Authors Asher M. Kach, Rodney G. Downey

Publication date 3 June 2011

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

Full work available at URL https://doi.org/10.1215/00294527-1306172

zbMATH Keywords

complexity of Euclidean functionscomputable Euclidean domainsproof-theoretical strengthreverse mathematics

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Recursive properties of Euclidean domains
• Transfinitely valued Euclidean domains have arbitrary indecomposable order type
• The minimal Euclidean function on the Gaussian integers
• Bounds for the Euclidean minima of function fields
• Euclidean rings of algebraic numbers and functions

Cited in

(7)

• Recursive properties of Euclidean domains
• The complexity of primes in computable unique factorization domains
• Computability and Beltrami fields in Euclidean space
• The minimal Euclidean function on the Gaussian integers
• Proper divisibility in computable rings
• Transfinitely valued Euclidean domains have arbitrary indecomposable order type
• Computing Euclidean Belyi maps

This page was built for publication: Euclidean functions of computable Euclidean domains

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