A resolution rule for well-formed formulae☆

https://doi.org/10.1016/0304-3975(91)90192-5Get rights and content
Under an Elsevier user license
open archive

Abstract

A resolution proof procedure that operates on well-formed formulae with all quantifiers in place is presented. Extension of the unification algorithm ρ Q-unification (i.e. with quantifiers in place) is also discussed. The procedure involves a single inference rule called WFF-resolution which is proved to be sound and complete.

Cited by (0)

☆

This paper was presented at the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science (Pune, 1988) and selected for publication by K.V. Nori.

Copyright © 1991 Published by Elsevier B.V.