Julien Narboux

Julien Narboux

Auto-generated profile, based on publicly available information

Julien Narboux

CNRS, Inria, IRIF, Université Paris Cité, Paris, France

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 January 2019 in Annals of Mathematics and Artificial Intelligence
Verified
Journal Article
Open access
PDF file
MBMichael Beeson
Michael Beeson
JNJulien Narboux
Julien Narboux
FWFreek Wiedijk
Freek Wiedijk
We used computer proof-checking methods to verify the correctness of our proofs of the propositions in Euclid Book I. We used axioms as close as possible to those of Euclid, in a language closely related to that used in Tarski’s formal geometry. We used proofs as close as possible to those given by Euclid, but filling Euclid’s gaps and correcting errors. Euclid Book I has 48 propositions; we proved 235 theorems. The extras were partly “Book Zero”, preliminaries of a very fundamental nature, partly propositions that Euclid omitted but were used implicitly, partly advanced theorems that we found necessary to fill Euclid’s gaps, and partly just variants of Euclid’s propositions. We wrote these proofs in a simple fragment of first-order logic corresponding to Euclid’s logic, debugged them using a custom software tool, and then checked them in the well-known and trusted proof checkers HOL Light and Coq.

7 January 2015 in Annals of Mathematics and Artificial Intelligence
Verified
Journal Article
Open access
PDF file
SÐSana Stojanović Ðurđević
Sana Stojanović Ðurđević
JNJulien Narboux
Julien Narboux
PJPredrag Janičić
Predrag Janičić
The power of state-of-the-art automated and interactive theorem provers has reached the level at which a significant portion of non-trivial mathematical contents can be formalized almost fully automatically. In this paper we present our framework for the formalization of mathematical knowledge that can produce machine verifiable proofs (for different proof assistants) but also human-readable (nearly textbook-like) proofs. As a case study, we focus on one of the twentieth century classics – a book on Tarski’s geometry. We tried to automatically generate such proofs for the theorems from this book using resolution theorem provers and a coherent logic theorem prover. In the first experiment, we used only theorems from the book, in the second we used additional lemmas from the existing Coq formalization of the book, and in the third we used specific dependency lists from the Coq formalization for each theorem. The results show that 37 % of the theorems from the book can be automatically proven (with readable and machine verifiable proofs generated) without any guidance, and with additional lemmas this percentage rises to 42 %. These results give hope that the described framework and other forms of automation can significantly aid mathematicians in developing formal and informal mathematical knowledge.

29 April 2016 in Journal of Automated Reasoning
Verified
Journal Article
Open access
PDF file
GBGabriel Braun
Gabriel Braun
JNJulien Narboux
Julien Narboux
In this paper, we report on the formalization of a synthetic proof of Pappus’ theorem. We provide two versions of the theorem: the first one is proved in neutral geometry (without assuming the parallel postulate), the second (usual) version is proved in Euclidean geometry. The proof that we formalize is the one presented by Hilbert in The Foundations of Geometry, which has been described in detail by Schwabhäuser, Szmielew and Tarski in part I of Metamathematische Methoden in der Geometrie. We highlight the steps that are still missing in this later version. The proofs are checked formally using the Coq proof assistant. Our proofs are based on Tarski’s axiom system for geometry without any continuity axiom. This theorem is an important milestone toward obtaining the arithmetization of geometry, which will allow us to provide a connection between analytic and synthetic geometry.

1 March 2015 in The Bulletin of Symbolic Logic
Verified
Journal Article
Closed access
PDF file
MBMichael Beeson
Michael Beeson
PBPierre Boutry
Pierre Boutry
JNJulien Narboux
Julien Narboux
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.

20 May 2022 in Journal of Automated Reasoning
Verified
Journal Article
Closed access
PDF file
PJPredrag Janičić
Predrag Janičić
JNJulien Narboux
Julien Narboux

25 May 2025 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
FMFrédéric Tran Minh
Frédéric Tran Minh
LGLaure Gonnord
Laure Gonnord
JNJulien Narboux
Julien Narboux
In parallel to the ever-growing usage of mechanized proofs in diverse areas of mathematics and computer science, proof assistants are used more and more for education. This paper surveys previous work related to the use of proof assistants for (mostly undergraduate) teaching. This includes works where the authors report on their experiments using proof assistants to teach logic, mathematics or computer science, as well as designs or adaptations of proof assistants for teaching. We provide an overview of both tutoring systems that have been designed for teaching proof and proving, or general-purpose proof assistants that have been adapted for education, adding user interfaces and/or dedicated input or output languages.