© 1998 by Oxford University Press
| ||||||||||||||||||||||||||||||||||||||||||||||||
Original Articles |
leanTAP Revisited
Department of Mathematics and Computer Science, Lehman College (CUNY) Bronx, NY 10468, USA Departments of Computer Science, Philosophy, Mathematics, Graduate Center (CUNY) 33 West 42nd Street, New York, NY 10036, USA E-mail: fitting{at}alpha.lehman.cuny.edu
A sequent calculus of a new sort is extracted from the Prolog program lean7AP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of lean7AP as a sequent calculus provides a new perspective on it and, in some ways, makes it easier to understand. It is also easier to verify correctness and completeness of the Prolog implementation. In addition, it suggests extensions to other logics, some of which are considered here.
Keywords: Automated theorem proving; lean7AP; modal logic; sequent calculus; tableau