Abstract
The purpose of this paper is to suggest two alternatives to Quine's definition of closure. These new definitions have two advantages over Quine's definition, and they probably are the simplest definitions having both advantages. The two advantages are:(1). Principle *101 becomes superfluous and may be dropped from Quine's set of principles for quantification. (In the case of my second definition, however, the dropping of *101 must be balanced by a slight change in *104.)(2). Closure is made independent of the alphabetical order of variables.The second of these advantages turns on the fact that the “alphabetical order” possessed by variables in virtue of their respective positions in the alphabet (or arbitrarily assigned to them) is a mere convention and not of genuine logical significance. It seems therefore desirable to consider some alternatives to Quine's definition of closure, since according to his definition the closure of a given formula will be one statement or another, depending upon whether or not one letter of the alphabet is alphabetically prior to a certain other letter. It is interesting that the removal of this minor artificiality also enables us to dispense with *101.According to Quine, the closure of a formula containing n free variables is obtained by prefixing to it in alphabetical order the n universal quantifiers formed from these variables by enclosing each in a pair of parentheses. (If n = 0 the formula is its own closure and is a “statement” rather than a “matrix.”) Thus the statement ‘(x)(y)(z)(xϵy ▪ yϵz)’ would be the closure of ‘xϵy ▪ yϵz’, but ‘(z)(x)(y)(xϵy ▪ yϵz)’ would not be its closure. Now there is no reason why ‘(z)(x)(y)(xϵy ▪ yϵz)’ or (y)(z)(x)(xϵy ▪ yϵz) and so on, could not just as well be regarded as “the” closure of ‘(xϵy ▪ yϵz’ as ‘(x)(y)(z)(xϵy ▪ yϵz)’. I therefore propose to allow to each formula not merely one closure, but as many closures as can be obtained by permuting in various ways the n prefixed universal quantifiers. In this way alphabetical order becomes irrelevant and no preference is given to one order of prefixed quantifiers in contrast to other orders which seem equally good. This constitutes my first redefinition of closure.
Publisher
Cambridge University Press (CUP)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A simplified formalization of predicate logic with identity;Archiv für Mathematische Logik und Grundlagenforschung;1964-03