Abstract
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.
This work was supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Belinfante, J.: Computer Assisted Proofs in Set Theory, Web site (2001), http://www.math.gatech.edu/~belinfan/research/autoreas/index.html
Epstein, R.: Propositional Logics: The Semantical Foundations of Logic. Oxford University Press, Oxford (1995)
Ernst, Z.: A Concise Axiomatization of RM→, Bulletin of the Section of Logic (to appear)
Ernst, Z., Fitelson, B., Harris, K., Wos, L.: Shortest Axiomatizations of Implicational S4 and S5, Preprint ANL/MCS-P919-1201 (December 2001)
Fitelson, B., Wos, L.: Missing Proofs Found. J. Automated Reasoning 27(2), 201–225 (2001)
Harris, K., Fitelson, B.: Distributivity in L-Aleph-0 and other Sentential Logics. J. Automated Reasoning 27, 141–156 (2001)
Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras I. North-Holland, Amsterdam (1971)
Kunen, K.: Single Axioms for Groups. J. Automated Reasoning 9(3), 291–308 (1992)
Lukasiewicz, J.: Selected Works, edited by L. Borowski. North Holland, Amsterdam (1970)
Lusk, E., McFadden, R.: Using Automated Reasoning Tools: A Study of the Semigroup F 2 B 2. Semigroup Forum 36(1), 75–88 (1987)
McCune, W., Wos, L.: A Case Study in Automated Theorem Proving: Finding Sages in Combinatory Logic. J. Automated Reasoning 3(1), 91–108 (1987)
McCune, W.: Single Axioms for Groups and Abelian Groups with Various Operations. J. Automated Reasoning 10(1), 1–13 (1993)
McCune, M., Padmanabhan, R.: Automated Deduction in Equational Logic and Cubic Curves. LNCS, vol. 1095. Springer, Heidelberg (1996)
McCune, W.: Solution of the Robbins Problem. J. Automated Reasoning 19(3), 263–276 (1997)
McCune, W.: Automatic Proofs and Counterexamples for Some Ortholattice Identities. Information Processing Letters 65, 285–291 (1998)
McCune, W., Veroff, R., Fitelson, B., Harris, K., Feist, A., Wos, L.: Short Single Axioms for Boolean Algebra. J. Automated Reasoning (accepted for publication)
Meredith, C.A.: Single Axioms for the Systems 〈C,N〉, 〈C,O〉, and 〈A,N〉 of the Two-Valued Propositional Calculus. J. Computing Systems 1(3), 155–164 (1953)
Meredith, C.A., Prior, A.: Notes on the Axiomatics of the Propositional Calculus. Notre Dame J. Formal Logic 4(3), 171–187 (1963)
Pavicic, M., Megill, N.: Non-Orthomodular Models for Both Standard Quantum Logic and Standard Classical Logic: Repercussions for Quantum Computers. Helv. Phys. Acta 72(3), 189–210 (1999)
Thiele, R., Wos, L.: Hilbert’s Twenty-Fourth Problem, Preprint ANL/MCS-P899-0801, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (2001)
Veroff, R.: Finding Shortest Proofs: An Application of Linked Inference Rules. J. Automated Reasoning 27(2), 123–139 (2001)
Veroff, R.: Solving Open Questions and Other Challenge Problems Using Proof Sketches. J. Automated Reasoning 27(2), 157–174 (2001)
Winker, S., Wos, L.: Automated Generation of Models and Counterexamples and Its Application to Open Questions in Ternary Boolean Algebra. In: Proceedings of the Eighth International Symposium on Multiple-Valued Logic, Rosemont, Illinois, pp. 251–256. IEEE and ACM (May 1978); reprinted In: Wos 2000, pp. 286–297
Winker, S., Wos, L., Lusk, E.: Semigroups, Antiautomorphisms, and Involutions: A Computer Solution to an Open Problem, I. Mathematics of Computation 37(156), 533–545 (1981); reprinted In: Wos 2000, pp. 315–329 (2000)
Wos, L.: The Kernel Strategy and Its Use for the Study of Combinatory Logic. J. Automated Reasoning 10(3), 287–343 (1993); reprinted In: Wos 2000, pp. 1221–1287 (2000)
Wos, L., Pieper, G.W.: A Fascinating Country in the World of Computing: Your Guide to Automated Reasoning. World Scientific, Singapore (1999)
Wos, L., Pieper, G.W.: Collected Works of Larry Wos, vol. 2. World Scientific, Singapore (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wos, L. (2005). The Flowering of Automated Reasoning. In: Hutter, D., Stephan, W. (eds) Mechanizing Mathematical Reasoning. Lecture Notes in Computer Science(), vol 2605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32254-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-32254-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25051-7
Online ISBN: 978-3-540-32254-2
eBook Packages: Computer ScienceComputer Science (R0)