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 (fix it)
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
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,709
External links
  •   Try with proxy.
  •   Try with proxy.
  •   Try with proxy.
  •   Try with proxy.
  • Through your library Only published papers are available at libraries

    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 ( #178,844 of 549,754 )

    Recent downloads (6 months)

    1 ( #63,425 of 549,754 )

    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.

    Other forums