Computers, Reasoning and Mathematical Practice

Computer aided formal reasoning, mathematical assistants which check complex arguments and automated proofs of new and interesting mathematical results have been part of the dream of computational logic for many years. This dream is in part being realised by the success of endeavours such as the Mizar project [110], which has produced many volumes of formalised mathematics, and McCune’s recent proof of the Robbins conjecture [79], cited, along with autonomous vehicle guidance and the chess program Deep Blue, as one of the five most significant achievements of artificial intelligence [114]. Yet it is still the case that few mathematicians use such programs, and their impact outside certain specialised communities has been less than might have been hoped.

[1]  M. Mahoney,et al.  History of Mathematics , 1924, Nature.

[2]  A. Whitehead.  Science and the Modern World , 1926 .

[3]  M. Ravenel,et al.  Science and the Modern World , 1926 .

[4]  J. Hadamard,et al.  The Psychology of Invention in the Mathematical Field. , 1945 .

[5]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[6]  J. C. Shaw,et al.  Empirical explorations of the logic theory machine: a case study in heuristic , 1899, IRE-AIEE-ACM '57 (Western).

[7]  K. Popper,et al.  Conjectures and Refutations , 1963 .

[8]  K. Popper,et al.  Conjectures and refutations;: The growth of scientific knowledge , 1972 .

[9]  I. Lakatos.  PROOFS AND REFUTATIONS (I)*† , 1963, The British Journal for the Philosophy of Science.

[10]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[11]  de Ng Dick Bruijn,et al.  The mathematical language AUTOMATH, its usage, and some of its extensions , 1970 .

[12]  David Hume.  A Treatise of Human Nature: Being an Attempt to introduce the experimental Method of Reasoning into Moral Subjects , 1972 .

[13]  G. Kreisel,et al.  Hilbert's programme and the search for automatic proof procedures , 1970 .

[14]  D. Gorenstein.  Finite simple groups and their classification , 1974 .

[15]  H. Swinnerton-Dyer,et al.  Ellitpic curves and modular functions , 1975 .

[16]  I. Lakatos,et al.  Proofs and Refutations: Frontmatter , 1976 .

[17]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[18]  Imre Lakatos,et al.  On the Uses of Rigorous Proof. (Book Reviews: Proofs and Refutations. The Logic of Mathematical Discovery) , 1977 .

[19]  S. Ulam,et al.  Mathematics and logic , 1979 .

[20]  Thomas Tymoczko.  Computers, Proofs and Mathematicians: A Philosophical Investigation of the Four-Color Proof , 1980 .

[21]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[22]  J. Conway,et al.  ATLAS of Finite Groups , 1985 .

[23]  Philip Kitcher,et al.  The Nature of Mathematical Knowledge. , 1985 .

[24]  George W. Ernst,et al.  CaseDE Design Environment Centers on Specifications , 1986, IEEE Software.

[25]  D. Gorenstein.  Classifying the finite simple groups , 1986 .

[26]  K. Appel,et al.  The four color proof suffices , 1986 .

[27]  Judith V. Grabiner,et al.  Computers and the nature of man: a historian’s perspective on controversies about artificial intelligence , 1986 .

[28]  David Hoffman,et al.  The computer-aided discovery of new embedded minimal surfaces , 1987 .

[29]  S. Chou.  Mechanical Geometry Theorem Proving , 1987 .

[30]  James H. Fetzer.  Program verification: the very idea , 1988, CACM.

[31]  Stephen G. Simpson,et al.  Partial realizations of Hilbert's program , 1988, Journal of Symbolic Logic.

[32]  A. Cohn.  The notion of proof in hardware verification , 1989 .

[33]  Ian Stewart,et al.  Does God play dice? , by Ian Stewart. Pp 317. £15. 1989. ISBN 0-631-16847-8 (Basil Blackwell) , 1989, Mathematical Gazette.

[34]  Stephen J. Garland,et al.  An Overview of LP, The Larch Power , 1989, RTA.

[35]  Deepak Kapur,et al.  Consider Only General Superpositions in Completion Procedures , 1989, RTA.

[36]  James R. Russell,et al.  A constructive proof of Higman's lemma , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[37]  C. W. H. Lam.  Opinion: How Reliable Is a Computer-Based Proof? , 1990 .

[38]  David B. A. Epstein,et al.  The Use of Knuth-Bendix Methods to Solve the Word Problem in Automatic Groups , 1991, J. Symb. Comput..

[39]  Ralf Schweizer.  Does God Play Dice? The Mathematics of Chaos, Ian Stewart. 1989. Basil Blackwell, Cambrdige, MA. 317 pages. ISBN: 0-631-16847-8. $19.95 , 1991 .

[40]  D. Ruelle.  Chance and Chaos , 2020 .

[41]  Stephen J. Garland,et al.  PVS: A Prototype . . . , 1992 .

[42]  Edmund M. Clarke,et al.  Analytica - A Theorem Prover in Mathematica , 1992, CADE.

[43]  J. Dieudonne.  Mathematics-- the music of reason , 1992 .

[44]  Richard D. Jenks,et al.  AXIOM: the scientific computation system , 1992 .

[45]  A. Jaffe,et al.  “Theoretical mathematics”: toward a cultural synthesis of mathematics and theoretical physics , 1993, math/9307227.

[46]  André Heck,et al.  Introduction to Maple , 1993 .

[47]  J. Horgan.  THE DEATH OF PROOF , 1993 .

[48]  John Harrison,et al.  Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals , 1993, HUG.

[49]  Frank van Harmelen,et al.  Rippling: A Heuristic for Guiding Inductive Proofs , 1993, Artif. Intell..

[50]  Claire Jones.  Completing the rationals and metric spaces in LEGO , 1993 .

[51]  Stephen J. Garland,et al.  Larch: Languages and Tools for Formal Specification , 1993, Texts and Monographs in Computer Science.

[52]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[53]  John Harrison,et al.  Constructing the real numbers in HOL , 1992, Formal Methods Syst. Des..

[54]  Natarajan Shankar,et al.  Metamathematics, machines, and Gödels's proof , 1994, Cambridge tracts in theoretical computer science.

[55]  Michael R. Lowry,et al.  Deductive Composition of Astronomical Software from Subroutine Libraries , 1994, CADE.

[56]  A. Jaffe,et al.  Response to comments on ``Theoretical Mathematics'' , 1994, math/9404231.

[57]  N Oreskes,et al.  Verification, Validation, and Confirmation of Numerical Models in the Earth Sciences , 1994, Science.

[58]  Edmund M. Clarke,et al.  Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan , 1994, CADE.

[59]  Robert S. Boyer,et al.  The QED Manifesto , 1994, CADE.

[60]  Jacques Calmet,et al.  Combining Theorem Proving and Symbolic Mathematical Computing , 1994, AISMC.

[61]  Ronald Brown,et al.  Calculations with Simplicial and Cubical Groups in AXIOM , 1994, J. Symb. Comput..

[62]  S. Lang.  Mordell’s review, Siegel’s Ietter to Mordell, diophantine geometry, and 20th century mathematics , 1994 .

[63]  W. Thurston.  On Proof and Progress in Mathematics , 1994, math/9404236.

[64]  Paul B. Jackson.  Exploring Abstract Algebra in Constructive Type Theory , 1994, CADE.

[65]  Jacques Calmet,et al.  Theorems and algorithms: an interface between Isabelle and Maple , 1995, ISSAC '95.

[66]  B. Rotman.  Thinking Dia-Grams: Mathematics, Writing, and Virtual Reality , 1995, Mathematics, Science, and Postclassical Theory.

[67]  Neil J. A. Sloane,et al.  The encyclopedia of integer sequences , 1995 .

[68]  Jean-Pierre Serre,et al.  Fermat ’ s Last Theorem , 2017 .

[69]  Allen Newell,et al.  Empirical explorations with the logic theory machine: a case study in heuristics , 1995 .

[70]  M. Stickel,et al.  Automated reasoning and exhaustive search: Quasigroup existence problems☆ , 1995 .

[71]  Silvio Levy,et al.  Making waves : a guide to the ideas behind Outside in , 1995 .

[72]  Gilbert Labelle.  Some Combinatorial Results First Found Using Computer Algebra , 1995, J. Symb. Comput..

[73]  A. Wiles.  Modular Elliptic Curves and Fermat′s Last Theorem(抜粋) (フェルマ-予想がついに解けた!?) , 1995 .

[74]  Susan S. Owicki,et al.  Network objects , 1995 .

[75]  Volker Sorge,et al.  Integrating Computer Algebra with Proof Planning , 1996, DISCO.

[76]  William McCune,et al.  Automated Deduction in Equational Logic and Cubic Curves , 1996, Lecture Notes in Computer Science.

[77]  Bart Selman,et al.  Critical Behavior in the Computational Cost of Satisfiability Testing , 1996, Artif. Intell..

[78]  J. Holbrook,et al.  Statistical sampling and fractal distributions , 1996 .

[79]  Bruno Buchberger.  Symbolic Computation: Computer Algebra and Logic , 1996, FroCoS.

[80]  Stephen Wolfram,et al.  The Mathematica Book , 1996 .

[81]  Richard J. Fateman.  Why computer algebra systems sometimes can't solve simple equations , 1996, SIGS.

[82]  Larry Wos,et al.  The Automation of Reasoning: An Experimenter's Notebook with Otter Tutorial , 1996 .

[83]  Alan Bundy,et al.  Automation of Diagrammatic Reasoning , 1997, IJCAI.

[84]  Robert Pollack,et al.  How to Believe a Machine-Checked Proof , 1997 .

[85]  Brendan D. McKay,et al.  Subgraph Counting Identities and Ramsey Numbers , 1997, J. Comb. Theory, Ser. B.

[86]  Volker Weispfenning,et al.  Simulation and Optimization by Quantifier Elimination , 1997, J. Symb. Comput..

[87]  Robin Thomas,et al.  The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.

[88]  David L. Waltz,et al.  Artificial Intelligence: Realizing the Ultimate Promises of Computing , 1997, AI Mag..

[89]  Hugo Herbelin,et al.  The Coq proof assistant : reference manual, version 6.1 , 1997 .

[90]  R. Bud.  Knowing Machines , 1998 .

[91]  J. Harrison.  Constructing the Real Numbers , 1998 .