Hostname: page-component-7479d7b7d-767nl Total loading time: 0 Render date: 2024-07-10T12:24:42.819Z Has data issue: false hasContentIssue false

On the syntactical construction of systems of modal logic

Published online by Cambridge University Press:  12 March 2014

J. C. C. Mckinsey*
Affiliation:
University of Nevada

Extract

When C. I. Lewis developed his theory of strict implication, he left open the question which of his various systems should be regarded as being closest to our intuitions—though he was inclined to favor the system S2. There are to be found in the literature numerous discussions of this question; most of these have condemned S2 as being too strong, and have proposed ways of weakening it.

In the present paper I shall attempt to throw some light on this question by setting up a syntactical definition of “possibility.” I shall show that every system of modal logic constructed on the basis of this definition is at least as strong as the Lewis system S4.

As the intuitive basis for the syntactical definition of possibility, I take the position that to say a sentence is possible means that there exists a true sentence of the same form. Thus, for example, it would be said that the sentence, “Lions are indigenous to Alaska,” is possible, because of the fact that the sentence, “Lions are indigenous to Africa,” has the same form and is true.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1945

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1 See Lewis, and Langford, , Symbolic logic, pp. 122198Google Scholar, and pp. 492-502.

1 In the following papers, for example: Nelson, E. J., Intensional relations, Mind, n.s. vol. 39 (1930), pp. 440453CrossRefGoogle Scholar; Duncan-Jones, A. E., Is strict implication the same as entailment?, Analysis, vol. 2 (19341935), pp. 7078CrossRefGoogle Scholar; Vredenduin, P. G. J., A system of strict implication, this Journal, vol. 4 (1939), pp. 7376.Google Scholar

3 This syntactical definition of possibility is based on certain ideas of Carnap. See The logical syntax of language, p. 181 and pp. 250-255. The inadequacy of the definition, however, has been more recently pointed out by Tarski, , in Über den Begriff der logischen Folgerung, Actes du Congrès International de Philosophie Scientifique, VII Logique, Actualités scientifiques et industrielles 394, pp. 111.Google Scholar For some remarks in this connection, see the third section of the present paper.

4 The formal description of our system, as well as the proof of theorems about it, becomes simpler if we suppose the sentential variables are simply those mentioned, instead of supposing, as Lewis does with regard to his systems, that we have different letters, sometimes affected with subscripts:

Since the choice of which letters are to be used as variables makes no difference in the formal properties of a system, we shall therefore hereafter suppose that the various Lewis calculi involve only the variables:

5 Since we are not concerned here with what variables a actually involves, but are interested only in the fact that it involves no variables except a certain finite class of variables, no loss of generality is involved in representing the variables by

instead by

for if α involves no variables except , and if γ is the maximum of the numbers ii, …, in, then α involves no variables except p1, …, pr. This observation will enable us considerably to simplify the notation to be used in later proofs.

In a similar way, if α involves no variables except ,and β involves no variables except , and if γ is the maximum of the numbers , then we can represent α as α, (pl, …, pr) and β as β(p1, …, pr)—where it is of course not assumed that all the variables p1, …, pr necessarily occur in α and β.

6 Parry, William Tuthill, Modalities in the Survey system of strict implication, this Journal, vol. 4 (1939), pp. 137154Google Scholar. See especially page 149.

7 The method used in this proof is essentially the same as that used in Gödel's, Kurt paper, Zum intuitionistischen Aussagenkalkül, Akademie der Wissenschaften in Wien, Mathematisch-naturwissenschaftliche Klasse, Anzeiger, vol. 69 (1932), pp. 6566.Google Scholar

8 Tarski, Alfred, Der Wahrheitsbegriff in den formalisierten Sprachen, Studia philosophica, vol. 1 (1936), pp. 261405.Google Scholar