The resolution rule: An algebraic perspective

From MaRDI portal





The goal of this paper is to show that propositional resolution proof systems can be conveniently introduced and studied within an algebraic framework. We view a resolution proof system as a finite universal algebra (of formulas) augmented with an inference operator. We prove a number of fundamental methodological results. In Section 3 we introduce the key definition of a resolution counterpart of a propositional logic, and give a characterization of structural logics with resolution counterparts. In Section 4 we discuss the role of strongly finite logics in the methodological studies on resolution proof systems, and show that for these logics resolution counterparts can be effectively constructed. Finally, in Section 5, we tackle some of the problems concerning the efficiency of theorem proving methods based on the resolution principle. In this context we study the notion of refutational approximation of a propositional logic, and investigate closure operators on classes of resolution proof systems. For the entire collection see [Zbl 0779.00012].











This page was built for publication: The resolution rule: An algebraic perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4273485)