Resolution in the Domain of Strongly Finite Logics
- 1 July 1990
- journal article
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 13 (3) , 333-351
- https://doi.org/10.3233/fi-1990-13307
Abstract
In this paper the notion of a resolution counterpart of a propositional logic is introduced and studied. This notion is based on a generalization of the resolution rule of J.A. Robinson. It is shown that for every strongly finite logic a refutationally complete nonclausal resolution proof system can be constructed and that the completeness of such systems is preserved with respect to the polarity and set of support strategies.Keywords
This publication has 0 references indexed in Scilit: