Resolution Framework for Finitely-Valued First-Order Logics

Download PDF
Open Webpage

Peter W. O'Hearn, Zbigniew Stachniak

Published: 1992, Last Modified: 16 May 2025J. Symb. Comput. 1992EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this paper we propose a resolution proof framework on the basis of which automated proof systems for finitely-valued first-order logics (FFO logics) can be introduced and studied. We define the notion of a first-order resolution proof system and we show that for every disjunctive FFO logic a refutationally complete resolution proof system can be constructed. Moreover, we discuss two theorem proving strategies, the polarity and set of support strategies, and we prove their completeness.