No CrossRef data available.
Published online by Cambridge University Press: 12 March 2014
Quine has given a method for eliminating the bound variables in first-order predicate logic establishing thus a variable-free formulation called predicate-functor logic. The purpose of this paper is to give an autonomous and complete proof procedure for Quine's predicate-functor logic with identity, without presupposing axioms or inference rules for quantification theory or, for that matter, any other logic.
I acknowledge my great gratitude to Quine who has inspired and stimulated this paper. He has read a first version with proofs in extenso and made critical remarks. I am particularly thankful to him for having informed me about the homogeneous intersection functor pointed out by Dr. Steven T. Kuhn along with advice to use it in place of the original (heterogeneous) one. I am also indebted to Quine for having directed my attention to the single permutation functor. I am further indebted to my friend Ali Karatay for his detailed examination of the draft and numerous suggestions. Finally I acknowledge my gratitude to the anonymous referee of this Journal for various useful suggestions; I am especially indebted to him for the identity rules used in the last version.