Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Hilbert
Grundlagen der Geometrie
J. Blanchette (2013)
Redirecting Proofs by Contradiction
Julien Narboux (2006)
Mechanical Theorem Proving in Tarski's Geometry
From the fact(s) A = B and A = B we get contradiction
M. Bezem, T. Coquand (2005)
Automating Coherent Logic
L. Henkin, P. Suppes, A. Tarski (1959)
The axiomatic method with special reference to geometry and physics : proceedings of an international symposium held at the University of California, Berkeley, December 26, 1957-January 4, 1958
A. Riazanov, A. Voronkov (2002)
The design and implementation of VAMPIREAI Commun., 15
S. Stojanovic, V. Pavlovic, Predrag Janičić (2010)
A Coherent Logic Based Geometry Theorem Prover Capable of Producing Formal and Readable Proofs
G. Sutcliffe (2009)
The TPTP Problem Library and Associated InfrastructureJournal of Automated Reasoning, 43
S. Stojanovic, Julien Narboux, M. Bezem, Predrag Janičić (2014)
A Vernacular for Coherent Logic
JC Blanchette, S Böhme, LC Paulson (2013)
Extending sledgehammer with SMT solversJ. Autom. Reason., 51
John Fisher, M. Bezem (2007)
Skolem Machines and Geometric Logic
Víctor Carreño (2002)
Theorem Proving in Higher Order Logics
W. Schwabhäuser, Wanda Szmielew, A. Tarski (1983)
Metamathematische Methoden in der Geometrie
M. Wenzel (1999)
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
J. Blanchette, S. Böhme, Lawrence Paulson
Noname manuscript No. (will be inserted by the editor) Extending Sledgehammer with SMT Solvers
(2011)
Proofs, Types and Lambda Calculus
G Sutcliffe (2009)
The TPTP problem library and associated infrastructure: The FOF and CNF parts, v3.5.0J. Autom. Reason., 43
Georges Gonthier, A. Asperti, J. Avigad, Yves Bertot, C. Cohen, François Garillot, Stéphane Roux, A. Mahboubi, Russell O'Connor, Sidi Biha, I. Pasca, L. Rideau, A. Solovyev, Enrico Tassi, L. Théry (2013)
A Machine-Checked Proof of the Odd Order Theorem
C. Tankink, C. Kaliszyk, J. Urban, H. Geuvers (2013)
Communicating Formal Proofs: The Case of Flyspeck
F. Wiedijk (2006)
The Seventeen Provers of the WorldLecture Notes in Computer Science
M. Beeson, L. Wos (2014)
OTTER Proofs in Tarskian Geometry
Gabriel Braun, Julien Narboux (2012)
From Tarski to Hilbert
T. Makarios (2013)
A further simplification of Tarski's axioms of geometryarXiv: Logic
J. Avigad, Edward Dean, J. Mumma (2008)
A FORMAL SYSTEM FOR EUCLID’S ELEMENTSThe Review of Symbolic Logic, 2
Christoph Weidenbach, D. Dimova, Arnaud Fietzke, Rohit Kumar, M. Suda, P. Wischnewski (2009)
SPASS Version 3.5
David Aspinall, J. Sevcík (2007)
Formalising Java's Data Race Free Guarantee
P. Boutry, Julien Narboux, P. Schreck, Gabriel Braun (2014)
Using small scale automation to improve both accessibility and readability of formal proofs in geometry
C. Kaliszyk, J. Urban (2012)
Learning-Assisted Automated Reasoning with FlyspeckJournal of Automated Reasoning, 53
Art Quaife (1989)
Automated development of Tarski's geometryJournal of Automated Reasoning, 5
J. Blanchette, J. Urban (2013)
Third International Workshop on Proof Exchange for Theorem Proving, PxTP 2013, Lake Placid, NY, USA, June 9-10, 2013, 14
(2007)
4th International Colloquium on Theoretical Aspects of Computing — ICTAC 2007, volume 4711 of Lecture Notes in Computer Science
M. Ganesalingam, W. Gowers (2013)
A fully automatic problem solver with human-style outputArXiv, abs/1309.4501
S. Schulz (2002)
E - a brainiac theorem proverAI Commun., 15
M. Bezem, D. Hendriks (2007)
On the Mechanization of the Proof of Hessenberg’s Theorem in Coherent LogicJournal of Automated Reasoning, 40
Laura Meikle, Jacques Fleuriot (2004)
Mechanical Theorem Proving in Computational Geometry
J. Blanchette, Lukas Bulwahn, T. Nipkow (2011)
Automatic Proof and Disproof in Isabelle/HOL
M. Beeson (2012)
Proof and Computation in Geometry
From the fact(s) A = B and A = D it holds that B = D. 9. The conclusion follows from the fact(s) B = D
NG Haragauri (1965)
Contributions to the axiomatic foundations of geometry. PhD thesis
P. Boutry, Julien Narboux, P. Schreck, Gabriel Braun (2014)
A short note about case distinctions in Tarski's geometry
J. Robinson (1965)
A Machine-Oriented Logic Based on the Resolution PrincipleJ. ACM, 12
(2006)
Mathematics, Algorithms, Proofs, volume 05021 of Dagstuhl Seminar Proceedings
Laura Meikle, Jacques Fleuriot (2003)
Formalizing Hilbert's Grundlagen in Isabelle/Isar
T. Hales (2005)
Introduction to the Flyspeck Project
A. Tarski (1959)
What is Elementary GeometryStudies in logic and the foundations of mathematics, 27
A. Tarski, S. Givant (1999)
Tarski's System of GeometryBulletin of Symbolic Logic, 5
(1965)
Contributions to the axiomatic foundations of geometry
(2007)
Proceedings of Automatic Deduction in Geometry 06, volume 4869 of Lecture Notes in Artificial Intelligence, pp
Assume that: A = B. 6. From the fact(s) AD ∼ = AB and A = B it holds that AD ∼ = AA. 7. From the fact(s) AD ∼ = AA
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.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jan 7, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.