Abstract

We prove that for every indecomposable ordinal there exists a (transfinitely valued) Euclidean domain whose minimal Euclidean norm is of that order type. Conversely, any such norm must have indecomposable type, and so we completely characterize the norm complexity of Euclidean domains. Modifying this construction, we also find a finitely valued Euclidean domain with no multiplicative integer valued norm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call