Euclidean Functions of Computable Euclidean Domains

Euclidean Functions of Computable Euclidean Domains

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 mini...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Notre Dame journal of formal logic 2011-01, Vol.52 (2), p.163-172
Hauptverfasser: Downey, Rodney G., Kach, Asher M.
Format: Artikel
Sprache:eng
Schlagworte:
03B30
03D45
Euclidean domain
Euclidean function
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0029-4527
1939-0726
DOI:10.1215/00294527-1306172