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: 94,420

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

A Priori Concepts in Euclidean Proof.Peter Fisher Epstein - 2018 - Proceedings of the Aristotelian Society 118 (3):407-417.
Kant's Views on Non-Euclidean Geometry.Michael Cuffaro - 2012 - Proceedings of the Canadian Society for History and Philosophy of Mathematics 25:42-54.
The origins of Schwinger׳s Euclidean Green׳s functions.Michael E. Miller - 2015 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 50:5-12.
Kant and the Impossibility of Non‐Euclidean Space.Tufan Kıymaz - 2019 - Philosophical Forum 50 (4):485-491.

Analytics

Added to PP
2011-04-29

Downloads
56 (#281,738)

6 months
20 (#173,150)

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