Finding Proofs in Tarskian Geometry

@article{Beeson2016FindingPI,
  title={Finding Proofs in Tarskian Geometry},
  author={Michael Beeson and Larry Wos},
  journal={Journal of Automated Reasoning},
  year={2016},
  volume={58},
  pages={181-207}
}
  • M. Beeson, L. Wos
  • Published 22 June 2016
  • Mathematics
  • Journal of Automated Reasoning
We report on a project to use a theorem prover to find proofs of the theorems in Tarskian geometry. These theorems start with fundamental properties of betweenness, proceed through the derivations of several famous theorems due to Gupta and end with the derivation from Tarski’s axioms of Hilbert’s 1899 axioms for geometry. They include the four challenge problems left unsolved by Quaife, who two decades ago found some OTTER proofs in Tarskian geometry (solving challenges issued in Wos’s 1998… 

Figures and Tables from this paper

From Hilbert to Tarski
In this paper, we describe the formal proof using the Coq proof assistant that Tarski's axioms for plane neutral geometry (excluding continuity axioms) can be derived from the corresponding Hilbert's
From Tarski to Descartes: Formalization of the Arithmetization of Euclidean Geometry
TLDR
The formalization of the arithmetization of Euclidean geometry in the Coq proof assistant is described, derived from Tarski's system of geometry a formal proof of the nine-point circle theorem using the Grobner basis method.
On the formalization of foundations of geometry
TLDR
A new proof is exposed that Euclid’s parallel postulate is not derivable from the other axioms of first-order Euclidean geometry, and Pejas’ classification of parallel postulates is refined.
Brouwer and Euclid
Portfolio theorem proving and prover runtime prediction for geometry
TLDR
This paper proposes a set of features which characterize a specific geometric theorem, so that machine learning techniques can be used in geometry and constructed several portfolios for theorem proving in geometry, and also runtime prediction models for provers involved.
Euclid After Computer Proof-checking
Euclid pioneered the concept of a mathematical theory developed from axioms by a series of justified proof steps. From the outset there were critics and improvers. In this century the use of
Formalization of the Poincaré Disc Model of Hyperbolic Geometry
TLDR
The Poincaré disc model of hyperbolic geometry within the Isabelle/HOL proof assistant is described and is shown to satisfy Tarski’s axioms except for Euclid's axiom.
Learning to solve geometric construction problems from images
TLDR
A purely image-based method for finding geometric constructions with a ruler and compass in the Euclidea geometric game based on adapting the Mask R-CNN state-of-theart visual recognition neural architecture and adding a tree-based search procedure to it.
Larry Wos: Visions of Automated Reasoning
This paper celebrates the scientific discoveries and the service to the automated reasoning community of Lawrence (Larry) T. Wos, who passed away in August 2020. The narrative covers Larry’s most
...
1
2
...

References

SHOWING 1-10 OF 38 REFERENCES
A Synthetic Proof of Pappus’ Theorem in Tarski’s Geometry
TLDR
This paper reports on the formalization of a synthetic proof of Pappus’ theorem, which is an important milestone toward obtaining the arithmetization of geometry, which will allow to provide a connection between analytic and synthetic geometry.
OTTER Proofs in Tarskian Geometry
TLDR
A project to use OTTER to find proofs of the theorems in Tarskian geometry proved in Szmielew’s part (Part I) of [9] to find the four challenge problems left unsolved by Quaife.
Automated generation of machine verifiable and readable proofs: A case study of Tarski’s geometry
TLDR
A framework for the formalization of mathematical knowledge that can produce machine verifiable proofs but also human-readable (nearly textbook-like) proofs and gives hope that the described framework and other forms of automation can significantly aid mathematicians in developing formal and informal mathematical knowledge.
Automated development of fundamental mathematical theories
I provide an introduction to automated reasoning, and in particular to resolution theorem proving using the prover OTTER written by William McCune. I explain such concepts as clauses, substitutions,
From Tarski to Hilbert
TLDR
This paper mechanized the proofs of the first twelve chapters of Schwabauser, Szmielew and Tarski's book: Metamathematische Methoden in der Geometrie to provide clear foundations for other formalizations of geometry and implementations of decision procedures.
ON A SYSTEM OF AXIOMS FOR GEOMETRY ' BY
In these Transactions, vol. 3 (1902), p. 142, E. H. Moore has given a set of projective axioms for geometry. In further development of the standpoint of Moore a system of axioms for three dimensional
Hammering towards QED
This paper surveys the emerging methods to automate reasoning over large libraries developed with formal proof assistants. We call these methods hammers. They give the authors of formal proofs a
Tarski's System of Geometry
Abstract This paper is an edited form of a letter written by the two authors (in the name of Tarski) to Wolfram Schwabhäuser around 1978. It contains extended remarks about Tarski's system of
A system of axioms for geometry
CHAPTER I. The axioms and their independence. Introductory statement of the axioms . . .1 Categorical and disjunctive systems . . . ? 2 Independence proofs and historical remarks on axioms IX-XII. ?
Learning-Assisted Automated Reasoning with Flyspeck
TLDR
It is shown that 39 % of the 14185 theorems could be proved in a push-button mode (without any high-level advice and user interaction) in 30 seconds of real time on a fourteen-CPU workstation.
...
1
2
3
4
...