Euclidean functions of computable Euclidean domains
From MaRDI portal
Publication:540403
DOI10.1215/00294527-1306172zbMath1260.03082OpenAlexW2029691756MaRDI QIDQ540403
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
reverse mathematicscomplexity of Euclidean functionscomputable Euclidean domainsproof-theoretical strength
Foundations of classical theories (including reverse mathematics) (03B30) Theory of numerations, effectively presented structures (03D45)
Related Items (2)
Proper divisibility in computable rings ⋮ The complexity of primes in computable unique factorization domains
This page was built for publication: Euclidean functions of computable Euclidean domains
