Access the full text.
Sign up today, get DeepDyve free for 14 days.
Bogdan Grechuk (2010)
Isabelle Primer for Mathematicians
anonymous (1994)
The QED Manifesto
TC Hales (2005)
A proof of the Kepler conjectureAnn. Math., 162
K. Appel, W. Haken (1977)
Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 21
A. Bundy, M. Atiyah, A. Macintyre, D. MacKenzie (2005)
The Nature of Mathematical ProofPhilosophical transactions - Royal Society. Mathematical, physical and engineering sciences, 363
Automated Theorem Provers: A Practical Tool for the Working Mathematician
Georges Gonthier (2008)
Formal Proof—The Four- Color Theorem
D. MacKenzie (2001)
Mechanizing Proof: Computing, Risk, and Trust
(2005)
The Flyspeck project fact sheet. http://code.google.com/p/flyspeck/wiki/FlyspeckFactSheet
K Appel, W Haken, J Koch (1977)
Every planar map is four colorable. I: Discharging. IllJ. Math., 21
A. Bundy, D. Basin, D. Hutter, Andrew Ireland (2005)
Rippling - meta-level guidance for mathematical reasoning, 56
S Autexier, D Hutter (2005)
Mechanizing Mathematical Reasoning
(1936)
See http://mizar.org for up-to-date information on Mizar and the
Makarius Wenzel (2007)
Isabelle/Isar — a Generic Framework for Human-Readable Proof Documents
M. Gordon (1979)
Edinburgh LCF: A mechanised logic of computation
Jacques Fleuriot, Lawrence Paulson (1998)
Proving Newton's Propositio Kepleriana Using Geometry and Nonstandard Analysis in Isabelle
A. Bundy, D. MacKenzie, M. Atiyah, A. Macintyre (2005)
Abstracts of additional presentations made at the Royal Society Discussion Meeting ‘The nature of mathematical proof’Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 363
A. Church (1936)
A note on the EntscheidungsproblemJournal of Symbolic Logic, 1
A. Bundy (1994)
Automated deduction, CADE-12 : 12th International Conference on Automated Deduction, Nancy, France, June 26-July 1, 1994 : proceedings
T. Hales (2008)
Formal Proof
A. Turing (1937)
On computable numbers, with an application to the EntscheidungsproblemProc. London Math. Soc., s2-42
T. Hales (1998)
The Kepler conjecturearXiv: Metric Geometry
RA Millo, RJ Lipton, AJ Perlis (1979)
Social processes and proofs of theorems and programsCommun. ACM, 22
A. Zalewska, R. Matuszewski (2007)
From insight to proof : Festschrift in honour of Andrzej Trybulec
M. Aschbacher (2005)
Highly complex proofs and implications of such proofsPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 363
D. Hutter, S. Autexier (2005)
Formal Software Development in MAYA
A. Church (1936)
An Unsolvable Problem of Elementary Number TheoryAmerican Journal of Mathematics, 58
W. Gowers (2010)
Rough Structure and Classification
D. Gorenstein (1982)
Finite Simple Groups: An Introduction to Their Classification
R. DeMillo, R. Lipton, A. Perlis (1978)
Social processes and proofs of theorems and programsThe Mathematical Intelligencer, 3
E. Denney, J. Power, Konstantinos Tourlas (2006)
Hiproofs: A Hierarchical Notion of Proof Tree
R. McCasland, A. Bundy, Patrick Smith (2006)
Ascertaining Mathematical Theorems
Robin Wilson (1991)
EVERY PLANAR MAP IS FOUR COLORABLEBulletin of The London Mathematical Society, 23
P. Rudnicki (1992)
An Overview of the MIZAR Project
A. Günter, R. Kruse, B. Neumann (2003)
Lectures Notes in Artificial Intelligence
U. Martin (1999)
Computers, Reasoning and Mathematical Practice
D. Hutter, W. Stephan (2005)
Mechanizing Mathematical Reasoning, Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday, 2605
Q. Charatan, Aaron Kans (2004)
Formal Software Development
Lawrence Paulson (2000)
Isabelle: The Next 700 Theorem ProversArXiv, cs.LO/9301106
In contrast to the widespread use of computer algebra systems in mathematics automated theorem provers have largely met with indifference. There are signs that this is at last beginning to change. We argue that it is inevitable that automated provers will be adopted as a practical tool for the working mathematician. Mathematical applications of automated provers raises profound challenges for their developers.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jul 16, 2011
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.