Euclidean Functions of Computable Euclidean Domains

Notre Dame Journal of Formal Logic 52 (2):163-172 (2010)
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
Keywords Euclidean domain   Euclidean function
Categories (categorize this paper)
DOI 10.1215/00294527-1306172
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,220
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
The Theory-Ladenness of Observations, the Role of Scientific Instruments, and the Kantian a 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.

Monthly downloads

Added to index

2011-04-29

Total downloads

13 ( #351,911 of 2,164,866 )

Recent downloads (6 months)

1 ( #348,012 of 2,164,866 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums