Pierre Boutry
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Pierre Boutry has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Julien Narboux
CNRS, Inria, IRIF, Université Paris Cité, Paris, France
4 shared publications Charly Gries
University of Strasbourg
1 shared publication- Charly Gries
Laboratoire ICube UMR 7357 CNRS Université de Strasbourg
1 shared publication - Danijela Simic
Institute of Public Health of Serbia “Dr Milan Jovanovic Batut”, Belgrade, Serbia
1 shared publication - Filip Marić
Faculty of Mathematics, University of Belgrade, Belgrade, Serbia
1 shared publication - Gabriel Braun
ICube, UMR 7357, University of Strasbourg - CNRS, Strasbourg, France
1 shared publication
Latest Publications
- 30 April 2020
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 65 (1) , 31-73
Formalization of the Poincaré Disc Model of Hyperbolic Geometry
- 30 April 2020
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 65 (1) , 31-73
Formalization of the Poincaré Disc Model of Hyperbolic Geometry
- Open Access
Axiomes de continuité en géométrie neutre : une étude mécanisée en Coq
Dans cet article, nous présentons les résultats sur la continuité que nous avons obtenus dans le cadre du projet GeoCoq, qui constitue une formalisation en Coq de la géométrie : nous avons défini 11 axiomes de continuité et établi leur hiérarchie. Nos démonstrations ont été formalisées dans le cadre de la géométrie neutre de Tarski en dimension quelconque et de la logique intuitionniste.
Open AccessAxiomes de continuité en géométrie neutre : une étude mécanisée en Coq
Dans cet article, nous présentons les résultats sur la continuité que nous avons obtenus dans le cadre du projet GeoCoq, qui constitue une formalisation en Coq de la géométrie : nous avons défini 11 axiomes de continuité et établi leur hiérarchie. Nos démonstrations ont été formalisées dans le cadre de la géométrie neutre de Tarski en dimension quelconque et de la logique intuitionniste.
- 23 January 2018
- Published by EasyChair
From Tarski to Descartes: Formalization of the Arithmetization of Euclidean Geometry
This paper describes the formalization of the arithmetization of Euclidean geometry in the Coq proof assistant.As a basis for this work, Tarski’s system of geometry was chosen for its well-known metamathematical properties.This work completes our formalization of the two-dimensional results contained in part one of Metamathematische Methoden in der Geometrie.We define the arithmetic operations geometrically and prove that they verify the properties of an ordered field.Then, we introduce cartesian coordinates, and provide an algebraic characterization of the main geometric predicates.In order to prove the characterization of the segment congruence relation, we provide a synthetic formal proof of two crucial theorems in geometry, namely the intercept and Pythagoras' theorems.The arithmetization of geometry justifies the use the algebraic automated deduction methods in geometry.We give an example of the use this formalization by deriving from Tarski's system of geometry a formal proof of theorems of nine points using Gröbner basis.
- 23 January 2018
- Published by EasyChair
From Tarski to Descartes: Formalization of the Arithmetization of Euclidean Geometry
This paper describes the formalization of the arithmetization of Euclidean geometry in the Coq proof assistant.As a basis for this work, Tarski’s system of geometry was chosen for its well-known metamathematical properties.This work completes our formalization of the two-dimensional results contained in part one of Metamathematische Methoden in der Geometrie.We define the arithmetic operations geometrically and prove that they verify the properties of an ordered field.Then, we introduce cartesian coordinates, and provide an algebraic characterization of the main geometric predicates.In order to prove the characterization of the segment congruence relation, we provide a synthetic formal proof of two crucial theorems in geometry, namely the intercept and Pythagoras' theorems.The arithmetization of geometry justifies the use the algebraic automated deduction methods in geometry.We give an example of the use this formalization by deriving from Tarski's system of geometry a formal proof of theorems of nine points using Gröbner basis.
- Open Access
- 8 September 2017
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 62 (1) , 1-68
Parallel Postulates and Continuity Axioms: A Mechanized Study in Intuitionistic Logic Using Coq
- 8 September 2017
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 62 (1) , 1-68
Open AccessParallel Postulates and Continuity Axioms: A Mechanized Study in Intuitionistic Logic Using Coq
- Open Access
A reflexive tactic for automated generation of proofs of incidence to an affine variety
This paper describes the formalization and implementation of a reflexive tactic for automated generation of proofs of incidence to an affine variety. Incidence proofs occur frequently in formal proofs of geometric statements. Nevertheless they are most of the time omitted in pen-and-paper proofs since they do not contribute to the understanding of the proof in which they appear. Our tactic allows us to automate proofs about incidence to an affine variety. Being based on a type class capturing the minimal set of properties needed to deal with incidence, the tactic is applicable to any theory verifying these properties. This type class is defined using dependent types to formalize predicates of parameterizable arity which represent the incidence to an affine variety.
Open AccessA reflexive tactic for automated generation of proofs of incidence to an affine variety
This paper describes the formalization and implementation of a reflexive tactic for automated generation of proofs of incidence to an affine variety. Incidence proofs occur frequently in formal proofs of geometric statements. Nevertheless they are most of the time omitted in pen-and-paper proofs since they do not contribute to the understanding of the proof in which they appear. Our tactic allows us to automate proofs about incidence to an affine variety. Being based on a type class capturing the minimal set of properties needed to deal with incidence, the tactic is applicable to any theory verifying these properties. This type class is defined using dependent types to formalize predicates of parameterizable arity which represent the incidence to an affine variety.
- 1 March 2015
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 21 (2) , 111-122
HERBRAND’S THEOREM AND NON-EUCLIDEAN GEOMETRY
We use Herbrand’s theorem to give a new proof that Euclid’s parallel axiom is not derivable from the other axioms of first-order Euclidean geometry. Previous proofs involve constructing models of non-Euclidean geometry. This proof uses a very old and basic theorem of logic together with some simple properties of ruler-and-compass constructions to give a short, simple, and intuitively appealing proof.
- 1 March 2015
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 21 (2) , 111-122
HERBRAND’S THEOREM AND NON-EUCLIDEAN GEOMETRY
We use Herbrand’s theorem to give a new proof that Euclid’s parallel axiom is not derivable from the other axioms of first-order Euclidean geometry. Previous proofs involve constructing models of non-Euclidean geometry. This proof uses a very old and basic theorem of logic together with some simple properties of ruler-and-compass constructions to give a short, simple, and intuitively appealing proof.