Axiom schemes for m-valued functional calculi of first order. Part II

Abstract

In part I of the present paper axiom schemes and rules of inference were defined for m-valued functional calculi of first order with s(m > s > 1) designated truth-values. A proof of plausibility was given, and it was shown that it is not difficult to extend to m-valued functional calculi of first order certain concepts that are closely analogous to the ordinary 2-valued notions of “consistency with respect to an operator” and “absolute consistency.” The purpose of the present paper is to show that the concept of “deductive completeness” may be extended to m-valued functional calculi of first order. For this purpose we define “analytic formula” for the m-valued case and show that if a formula is analytic, then it is provable in our formalization of m-valued functional calculi of first order.In proving deductive completeness for the m-valued case, it is possible to use a method which is analogous to that used by Gödel in establishing the completeness of 2-valued functional calculi of first order. However, in the present paper we will indicate only very briefly how the Gödel procedure may be extended to the m-valued case. Our chief concern will be the problem of extending to our formalization of m-valued functional calculi the more elegant proof of deductive completeness for the 2-valued case which has recently been developed by Leon Henkin.