Abstract
For more than three and one-half decades, beginning in the early 1960s, a heavy emphasis on proof finding has been a key component of the Argonne paradigm, whose use has directly led to significant advances in automated reasoning and important contributions to mathematics and logic. The theorems studied range from the trivial to the deep, even including some that corresponded to open questions. Often the paradigm asks for a theorem whose proof is in hand but that cannot be obtained in a fully automated manner by the program in use. The theorem whose hypothesis consists solely of the Meredith single axiom for two-valued sentential (or propositional) calculus and whose conclusion is the Łukasiewicz three-axiom system for that area of formal logic was just such a theorem. Featured in this article is the methodology that enabled the program OTTER to find the first fully automated proof of the cited theorem, a proof with the intriguing property that none of its steps contains a term of the form n(n(t)) for any term t. As evidence of the power of the new methodology, the article also discusses OTTER's success in obtaining the first known proof of a theorem concerning a single axiom of Łukasiewicz.
Similar content being viewed by others
References
Fitelson, B. and Wos, L.: Missing proofs found, J. Automated Reasoning (2001), this issue.
Łukasiewicz, J.: Selected Works, edited by L. Borokowski, North-Holland, Amsterdam, 1970.
McCune, W.: OTTER: 3.0 reference manual and guide, Tech. Report ANL-94/6, Argonne National Laboratory, Argonne, IL, 1994.
McCune, W. and Wos, L.: Experiments in automated deduction with condensed detachment, in D. Kapur (ed.), Proceedings of the Eleventh International Conference on Automated Deduction (CADE-11), Lecture Notes in Artificial Intelligence 607, Springer-Verlag, New York, 1992, pp. 209-223.
Meredith, C. A.: Single axioms for the systems (C,N), (C, 0), and (A,N) of the two-valued propositional calculus, J. Computing Systems 1 (1953), 155-164.
Rose, A. and Rosser, J. B.: Fragments of many-valued statement calculi, Trans. Amer. Math. Soc. 87 (1958), 1-53.
Sutcliffe, G. and Suttner, C.: The TPTP problem library for automated theorem proving, http://www.cs.jcu.edu.au/~tptp/.
Veroff, R.: Using hints to increase the effectiveness of an automated reasoning program: Case studies, J. Automated Reasoning 16(3) (1996), 223-239.
Wos, L.: The resonance strategy, Comput. Math. Appl. 29 (February 1995), 133-178.
Wos, L.: The Automation of Reasoning: An Experimenter's Notebook with OTTER Tutorial, Academic Press, New York, 1996.
Wos, L.: Automating the search for elegant proofs, J. Automated Reasoning 21(2) (1998), 135-175.
Wos, L. and Pieper, G. W.: A Fascinating Country in the World of Computing: Your Guide to Automated Reasoning, World Scientific, 1999.
Wos, L. and Pieper, G. W.: The hot list strategy, J. Automated Reasoning 22(1) (1999), 1-44.
Wos, L.: Lemma inclusion versus lemma adjunction, AAR Newsletter 44 (July 1999) (<http://www>. mcs.anl.gov/AAR/issuejuly99/index.html).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wos, L. Conquering the Meredith Single Axiom. Journal of Automated Reasoning 27, 175–199 (2001). https://doi.org/10.1023/A:1010691726881
Issue Date:
DOI: https://doi.org/10.1023/A:1010691726881