Abstract
This paper gives a brief overview of FG, a formal system for doing Euclidean geometry whose basic syntactic elements are geometric diagrams, and which has been implimentented as the computer system CDEG. The computational complexity of determining whether or not a given diagram is satisfiable is also briefly discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Euclid, Elements, T. L. Heath, ed., second edition, New York: Dover, 1956.
Forder, Henry George, The Foundations of Euclidean Geometry, Cambridge: Cambridge University Press, 1927.
Miller, Nathaniel, “Case Analysis in Euclidean Geometry,” available at http://www.math.cornell.edu/~nat/diagrams.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miller, N. (2000). Case Analysis in Euclidean Geometry: An Overview. In: Anderson, M., Cheng, P., Haarslev, V. (eds) Theory and Application of Diagrams. Diagrams 2000. Lecture Notes in Computer Science(), vol 1889. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44590-0_44
Download citation
DOI: https://doi.org/10.1007/3-540-44590-0_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67915-8
Online ISBN: 978-3-540-44590-6
eBook Packages: Springer Book Archive