
doi: 10.1007/bf00248251
The paper presents an advocation of the use of automated theorem provers in the area of combinatory logic. The work, inspired by \textit{R. M. Smullyan} [To Mock a Mockingbird (Alfred A. Knopf, New York, 1985)], demonstrates ways of very elegant application of paramodulation theorem proving using system ITP to solving of combinatory logic problems. For related discussion, cf. also the preceding review.
proof checking, Mechanization of proofs and logical operations, automated theorem provers, Combinatory logic and lambda calculus, ITP, combinatory logic, automated reasoning, paramodulation, Theorem proving (deduction, resolution, etc.)
proof checking, Mechanization of proofs and logical operations, automated theorem provers, Combinatory logic and lambda calculus, ITP, combinatory logic, automated reasoning, paramodulation, Theorem proving (deduction, resolution, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
