Skip to Main content Skip to Navigation

On the Formalization of Foundations of Geometry

Abstract : In this thesis, we investigate how a proof assistant can be used to study the foundations of geometry. We start by focusing on ways to axiomatize Euclidean geometry and their relationship to each other. Then, we expose a new proof that Euclid's parallel postulate is not derivable from the other axioms of first-order Euclidean geometry. This leads us to refine Pejas' classification of parallel postulates. We do so by considering decidability properties when classifying the postulates. However, our intuition often guides us to overlook uses of such properties. A proof assistant allows us to use a perfect tool which possesses no intuition: a computer. Moreover, proof assistants let us leverage the computational capabilities of computers. We demonstrate how we enable the use of algebraic automated deduction methods thanks to the arithmetization of geometry. Finally, we present a specific procedure designed to automate proofs of incidence properties.
Document type :
Complete list of metadata

Cited literature [191 references]  Display  Hide  Download
Contributor : Pierre Boutry <>
Submitted on : Friday, February 22, 2019 - 6:27:54 PM
Last modification on : Wednesday, September 4, 2019 - 3:45:19 PM
Long-term archiving on: : Thursday, May 23, 2019 - 1:38:39 PM


  • HAL Id : tel-02012674, version 1


Pierre Boutry. On the Formalization of Foundations of Geometry. Logic in Computer Science [cs.LO]. Université de Strasbourg, 2018. English. ⟨tel-02012674⟩



Record views


Files downloads