OTTER experiments in a system of combinatory logic (1995)
| Venue: | Journal of Automated Reasoning |
| Citations: | 6 - 1 self |
BibTeX
@ARTICLE{Jech95otterexperiments,
author = {Thomas Jech},
title = {OTTER experiments in a system of combinatory logic},
journal = {Journal of Automated Reasoning},
year = {1995},
pages = {413--426}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper describes some experiments involving the automated theoremproving program OTTER in the system TRC of illative combinatory logic. We show how OTTER can be steered to find a contradiction in an inconsistent variant of TRC, and present some experimentally discovered identities in TRC. 1. Introduction. OTTER [5] is a resolution/paramodulation theorem-proving program for firstorder logic with equality. It has been used successfully in several areas of logic and algebra [8], [9], [6], [7], [4]. In this paper we describe our experiments with OTTER in the system TRC
Citations
| 183 | Combinatory Logic I - Curry, Feys - 1958 |
| 163 | The Lambda Calculus - Barendregt - 1981 |
| 19 | Single axioms for groups - Kunen - 1992 |
| 11 | Systems of combinatory logic related to quie’s new foundation - Holmes - 1991 |
| 10 | Automated discovery of new axiomatizations of the left group and right group calculi - McCune - 1992 |
| 6 | The kernel strategy and its use for the study of combinatory logic - Wos - 1993 |
| 4 | Automated reasoning answers open questions - Wos - 1993 |
| 1 | Single axiom for groups with various operations - McCune - 1992 |
