Home Online Resources Table of Contents

Journal of Logic and Computation, Volume 8, Issue 1: February 1998.

lean TAP revisited

M Fitting

Department of Mathematics and Computer Science, Lehman College (CUNY), Bronx, NY 10468, USA and Departments of Computer Science, Philosophy, Mathematics, Graduate Center (CUNY), 33 West 42nd Street, New York, NY 10036, USA. E-mail: fitting@alpha.lehman.cunyedu

A sequent calculus of a new sort is extracted from the Prolog program lean TAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of lean TAP 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, lean TAP, modal logic, sequent calculus, tableau.

Pages 33-47

This page is run by Oxford University Press, Great Clarendon Street, Oxford OX2 6DP, UK
as part of the OUP Journals World Wide Web service.
Comments and feedback: www-admin@oup.co.uk
URL: http://www.oup.co.uk/logcom/hdb/Volume_08/Issue_01/080033.sgm.abs.html
Last modification: 1 June 1998.
Copyright© Oxford University Press, 1998.