Higher-Order Multi-Valued Resolution

Abstract

This paper introduces a multi-valued variant of higher-order resolution and proves it correct and complete with respect to a natural multi-valued variant of Henkin’s general model semantics. This resolution method is parametric in the number of truth values as well as in the particular choice of the set of connectives (given by arbitrary truth tables) and even substitutional quantifiers. In the course of the completeness proof we establish a model existence theorem for this logical system. The work reported in this paper provides a basis for developing higher-order mechanizations for many non-classical logics.