Axiomatization of the infinite-valued predicate calculus

Abstract

The infinite-valued statement calculus to which this paper refers is that of Łukasiewicz [10], whose axiomatization was proved complete in [5]. In [9], Rutledge extended this system to include predicates and quantifiers2 and presented a deductively complete set of axioms for the monadic predicate calculus. This paper represents an attempt to axiomatize the full predicate calculus; for the proposed axiomatization, a property akin to but weaker than completeness is proved. An attempt to prove full completeness along similar lines failed; it has since been shown [11] that the set of valid formulas of the infinite-valued predicate calculus is not recursively enumerable. The method of this paper was suggested by Professor J. Barkley Rosser.