Abstract
We study the complexity of (finitely-valued and transfinitely-valued) Euclidean functions for computable Euclidean domains. We examine both the complexity of the minimal Euclidean function and any Euclidean function. Additionally, we draw some conclusions about the proof-theoretical strength of minimal Euclidean functions in terms of reverse mathematics.
Citation
Rodney G. Downey. Asher M. Kach. "Euclidean Functions of Computable Euclidean Domains." Notre Dame J. Formal Logic 52 (2) 163 - 172, 2011. https://doi.org/10.1215/00294527-1306172
Information