Euclidean functions of computable Euclidean domains

DOI10.1215/00294527-1306172zbMATH Open1260.03082OpenAlexW2029691756MaRDI QIDQ540403FDOQ540403

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

reverse mathematicscomplexity of Euclidean functionscomputable Euclidean domainsproof-theoretical strength

Mathematics Subject Classification ID

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

Cited In (5)

• Computability and Beltrami fields in Euclidean space
• The minimal Euclidean function on the Gaussian integers
• The complexity of primes in computable unique factorization domains
• Computing Euclidean Belyi maps
• Proper divisibility in computable rings

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)