Decision Problems in Euclidean Geometry

Abstract
We show the algorithmic unsolvability of a number of decision procedures in ordinary two dimensional Euclidean geometry, involving lines and integer points. We also consider formulations involving integral domains of characteristic 0, and ordered rings. The main tool is the solution to Hilbert's Tenth Problem. The limited number of facts used from recursion theory are isolated at the beginning.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
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 Translate to english
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,371
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.

Citations of this work BETA

No citations found.

Similar books and articles
Richard Vesley (1999). Constructivity in Geometry. History and Philosophy of Logic 20 (3-4):291-294.
E. Slowik (2003). Conventionalism in Reid's 'Geometry of Visibles'. Studies in History and Philosophy of Science Part A 34 (3):467-489.
Analytics

Monthly downloads

Added to index

2010-12-22

Total downloads

4 ( #258,815 of 1,102,876 )

Recent downloads (6 months)

1 ( #297,281 of 1,102,876 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.