Recursive properties of Euclidean domains (Q1062977): Difference between revisions

The article under review investigates the existence of a recursive, finitely valued Euclidean function and whether the set of units is recursive in recursively presented Euclidean domains. This work situates itself within the scope of the broad program of recursive mathematics developed by Metakides, Nerode, Remmel and others. If R is a domain, then a Euclidean function is a mapping from the non- zero elements of R into the ordinals, which satisfies the property that if d, a are non-zero and d does not divide a, then there exists an element q of R for which \(f(a+dq)<f(d)\). A Euclidean function is finitely valued if its range is contained in \(\omega\). A domain is Euclidean if it possesses a Euclidean function. Let E be the statement that the domain has a recursive, finitely valued Euclidean function. Let U be the statement that the set of units of the domain is recursive. The article constructs recursively presented Euclidean domains satisfying E \& U, E \& \(\sim U\), \(\sim E \& U\), \(\sim E \& \sim U\). In so doing, the author develops various algebraic techniques and rather than using a priority argument, encodes an r.e. complete set into the problem at hand.