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.
Complete list of metadatas

Cited literature [215 references]  Display  Hide  Download

Contributor : Abes Star <>
Submitted on : Wednesday, June 26, 2019 - 4:00:11 PM
Last modification on : Wednesday, July 10, 2019 - 11:53:23 AM


Version validated by the jury (STAR)


  • HAL Id : tel-02166221, version 1


Pierre Boutry. On the formalization of foundations of geometry. Geometric Topology [math.GT]. Université de Strasbourg, 2018. English. ⟨NNT : 2018STRAD042⟩. ⟨tel-02166221⟩



Record views


Files downloads