Abstract
We present in this article an application of automated theorem proving to a study of a theorem in combinatory logic. The theorem states: the strong fixed point property is satisfied in a system that contains the B and W combinators. The theorem can be stated in terms of Smullyan's forests of birds: a sage exists in a forest that contains a bluebird and a warbler. Proofs of the theorem construct sages from B and W. Prior to the study, one sage, discovered by Statman, was known to exist. During the study, with much assistance from two automated theorem-proving programs, four new sages were discovered. The study was conducted from a syntactic point of view because the authors know very little about combinatory logic. The uses of the automated theorem-proving programs are described in detail.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Glickfeld, B. and Overbeek, R., ‘A Foray Into Combinatory Logic’, Journal of Automated Reasoning 2(4), 419–431 (1986).
Lusk, E. and Overbeek, R., ‘The automated reasoning system ITP’, ANL-84-27, Argonne National Laboratory (April, 1984).
Smullyan, R., To Mock a Mockingbird, Alfred A. Knopf, New York (1985).
Smullyan, R., April, 1986.
Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning: Introduction and Applications, Prentice-Hall, Englewood Cliffs, New Jersey (1984).
Wos, L., Winker, S., Veroff, R., Smith, B., and Henschen, L., ‘A new use of an automated reasoning assistant: open questions in equivalential calculus and the study of infinite domains’, Artificial Intelligence 22, 303–356 (1984).
Author information
Authors and Affiliations
Additional information
This work was supported by the Applied Mathematical Sciences subprogram of the office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.
Rights and permissions
About this article
Cite this article
McCune, W., Wos, L. A case study in automated theorem proving: Finding sages in combinatory logic. J Autom Reasoning 3, 91–107 (1987). https://doi.org/10.1007/BF00381147
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00381147