Euclidean Functions of Computable Euclidean Domains

Notre Dame Journal of Formal Logic 52 (2):163-172 (2011)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The theory‐ladenness of observations, the role of scientific instruments, and the Kantiana priori.Ragnar Fjelland - 1991 - International Studies in the Philosophy of Science 5 (3):269 – 280.
Kant and non-euclidean geometry.Amit Hagar - 2008 - Kant Studien 99 (1):80-98.
Wittgenstein and the regular heptagon.Felix Mühlhölzer - 2001 - Grazer Philosophische Studien 62 (1):215-247.

Analytics

Added to PP
2011-04-29

Downloads
45 (#335,929)

6 months
9 (#242,802)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Recursive properties of Euclidean domains.Leonard Schrieber - 1985 - Annals of Pure and Applied Logic 29 (1):59-77.

Add more references