Reseña: A synthetic proof of Pappus’ theorem in Tarski’s geometry

Se ha publicado un artículo de razonamiento formalizado en Coq sobre geometría titulado A synthetic proof of Pappus’ theorem in Tarski’s geometry

Sus autores son Gabriel Braun y Julien Narboux (del Équipe Informatique Géométrique et Graphique en la Universidad de Estrasburgo, Francia).

Su resumen es

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 detailed by Schwabhäuser, Szmielew and Tarski in part I of Metamathematische Methoden in der Geometrie. We highlight the steps which 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.

El código de las correspondientes teorías en Coq se encuentra aquí.

Reseña: Parallel postulates and decidability of intersection of lines: a mechanized study within Tarski’s system of geometry

Se ha publicado un artículo de razonamiento formalizado en Coq sobre geometría titulado Parallel postulates and decidability of intersection of lines: a mechanized study within Tarski’s system of geometry.

Sus autores son Pierre Boutry, Julien Narboux y Pascal Schreck (del Équipe Informatique Géométrique et Graphique en la Universidad de Estrasburgo, Francia)

Su resumen es

In this paper we focus on the formalization of the proof of equivalence between different versions of Euclid’s 5 th postulate. This postulate is of historical importance because for centuries many mathematicians believed that this statement was rather a theorem which could be derived from the first four of Euclid’s postulates and history is rich of incorrect proofs of Euclid’s 5 th postulate. These proofs are incorrect because they assume more or less implicitly a statement which is equivalent to Euclid’s 5 th postulate and whose validity is taken for granted. Even though these proofs are incorrect the attempt was not pointless because the flawed proof can be turned into a proof that the unjustified statement implies the parallel postulate. In this paper we provide formal proofs verified using the Coq proof assistant that 10 different statements are equivalent to Euclid’s 5 th postulate. We work in the context of Tarski’s neutral geometry without continuity nor Archimedes’ axiom. The formalization provide a clarification of the hypotheses used for the proofs. Following Beeson, we study the impact of the choice of a particular version of the parallel postulate on the decidability issues.

El código de las correspondientes teorías en Coq se encuentra aquí.

Reseña: A formalisation of metric spaces in HOL Light

Se ha publicado un artículo de razonamiento formalizado en HOL Light sobre topología titulado A formalisation of metric spaces in HOL Light.

Su autor es Marco Maggesi (de la Univ. de Florencia en Italia).

Su resumen es

We present a computer formalisation of metric spaces in the HOL Light theorem prover. Basic results of the theory of complete metric spaces are proved. A simple decision procedure for the theory of metric space is implemented.

El trabajo se ha presentado en CICM 2015 (the 8th Conference on Intelligent Computer Mathematics).

Reseña: Formalizing divisibility rules as a student case study

Se ha publicado un artículo de razonamiento formalizado en Mizar sobre aritmética titulado Formalizing divisibility rules as a student case study.

Su autor es Adam Naumowicz (de la Univ. de Białystok en Polonia).

Su resumen es

We would like to present some results of a student case study administered as a part of an interactive theorem proving elective course for computer science students. The students’ task was to prove in Mizar the divisibility rules for selected primes based on the decimal representation of natural numbers. The formalized proofs were quite elementary, so a project like this could be carried out by a group of students without particularly strong mathematical background. In this paper we give a short overview of definitions that had to be introduced for the case study and present the way the divisibility rules were eventually formulated by the students. After that we discuss an example of a more interesting proof case, i.e. the divisibility by 11 rule.

El trabajo se ha presentado en CICM 2015 (the 8th Conference on Intelligent Computer Mathematics).

Reseña: How functional programming mattered

Se ha publicado un artículo sobre el estado de la programación funcional titulado How functional programming mattered

Sus autores son

Su resumen es

In 1989 when functional programming was still considered a niche topic, Hughes wrote a visionary paper arguing convincingly “why functional programming matters“. More than two decades have passed. Has functional programming really mattered? Our answer is a resounding “Yes!”. Functional programming is now at the forefront of a new generation of programming technologies, and enjoying increasing popularity and influence. In this paper, we review the impact of functional programming, focusing on how it has changed the way we may construct programs, the way we may verify programs, and fundamentally the way we may think about programs.

El trabajo se ha publicado en National Science Review.