The Flowering of Automated Reasoning

This article celebrates with obvious joy the role automated reasoning now plays for mathematics and logic. Simultaneously, this article evidences the realization of a dream thought impossible just four decades ago by almost all. But there were believers, including Joerg Siekmann to whom this article is dedicated in honor of his sixtieth birthday. Indeed, today (in the year 2001) a researcher can enlist the aid of an automated reasoning program often with the reward of a new proof or a better proof in some significant aspect. The contributions to mathematics and logic made with an automated reasoning assistant are many, diverse, often significant, and of the type Hilbert would indeed have found most pleasurable. The proofs discovered by W. McCune’s OTTER (as well as other programs) are Hilbert-style axiomatic. Further, some of them address Hilbert’s twenty-fourth problem (recently unearthed by Rudiger Thiele), which focuses on the completion of simpler proofs. In that regard, as well as others, I offer challenges and open questions, frequently providing appropriate clauses to provide a beginning.

[1]  Larry Wos,et al.  A case study in automated theorem proving: Finding sages in combinatory logic , 1987, Journal of Automated Reasoning.

[2]  William McCune Automatic Proofs and Counterexamples for Some Ortholattice Identities , 1998, Inf. Process. Lett..

[3]  William McCune,et al.  Solution of the Robbins Problem , 1997, Journal of Automated Reasoning.

[4]  Branden Fitelson,et al.  Distributivity in Łℵ0 and Other Sentential Logics , 2004, Journal of Automated Reasoning.

[5]  A. N. Prior,et al.  Notes on the axiomatics of the propositional calculus , 1963, Notre Dame J. Formal Log..

[6]  Branden Fitelson,et al.  Missing Proofs Found , 2001, Journal of Automated Reasoning.

[7]  Branden Fitelson,et al.  Shortest Axiomatizations of Implicational S4 and S5 , 2002, Notre Dame J. Formal Log..

[8]  Larry Wos,et al.  The kernel strategy and its use for the study of combinatory logic , 1993, Journal of Automated Reasoning.

[9]  Rüdger Thiele,et al.  Hilbert's Twenty-Fourth Problem , 2002, Journal of Automated Reasoning.

[10]  L. Wos,et al.  Automated generation of models and counterexamples and its application to open questions in Ternary Boolean algebra , 1978, MVL '78.

[11]  Robert Veroff,et al.  Solving Open Questions and Other Challenge Problems Using Proof Sketches , 2001, Journal of Automated Reasoning.

[12]  A. Church Review: Carew A. Meredith, Single Axioms for the Systems $(C, N), (C, 0)$ and $(A, N)$ of the Two- Valued Propositional Calculus , 1954 .

[13]  Robert Veroff,et al.  Finding Shortest Proofs: An Application of Linked Inference Rules , 2001, Journal of Automated Reasoning.

[14]  M. Pavicic,et al.  Non-Orthomodular Models for Both Standard Quantum Logic and Standard Classical Logic: Repercussions for Quantum Computers , 1999 .

[15]  Larry Wos,et al.  A fascinating country in the world of computing: your guide to automated reasoning , 1999 .

[16]  Larry Wos,et al.  Short Single Axioms for Boolean Algebra , 2002, Journal of Automated Reasoning.

[17]  Kenneth Kunen Single axioms for groups , 2004, Journal of Automated Reasoning.

[18]  Ewing Lusk,et al.  Using automated reasoning tools: A study of the semigroupF2B2 , 1987 .

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

[20]  The collected works of Larry Wos , 2000 .

[21]  L. Wos,et al.  A CONCISE AXIOMATIZATION OF RM , 2001 .

[22]  William McCune,et al.  Single axioms for groups and Abelian groups with various operations , 1993, Journal of Automated Reasoning.

[23]  Larry Wos,et al.  The Collected Works of Larry Wos (In 2 Volumes) - Volume I: Exploring the Power of Automated Reasoning - Volume II: Applying Automated Reasoning to Puzzles, Problems, and Open Questions , 2000 .

[24]  E. L. Lusk,et al.  Semigroups, antiautomorphisms, and involutions: a computer solution to an open problem. I , 1981 .