Hostname: page-component-7c8c6479df-27gpq Total loading time: 0 Render date: 2024-03-27T20:43:04.840Z Has data issue: false hasContentIssue false

Modal functions in two-valued logic

Published online by Cambridge University Press:  12 March 2014

Frederic B. Fitch*
Affiliation:
Yale University

Extract

In this paper it will be shown that the fundamental modal functions (“… is necessary,” “… is possible,” etc.) may be represented in the ordinary two-valued logic of propositions, relatively to a subset S of the set K of all propositions of the logic. The only restriction on S is that no member of S can occur in any other member of S. The representation concerns the set SK consisting of all members of K in which occur members of S. Every member of SK may be regarded as a truth-function of the members of S. If S consists of only one member, P, and if f(P) and g(P) are any members of SK, then we define ∣f(P)∣ as (f(Pf(~P)). The proposition “f(P) is S-necessary” may then be expressed by ∣f(P)· Furthermore we may express “f(P) is S-impossible” by ∣~f(P)∣, abbreviated to f(P)*; we may express “f(P) is S-possible” by abbreviated to f(P); and we may express “f(P) S-strictly implies g(P)” by (f(P)·~g(P))*, abbreviated to f(P)⊰g(P). Thus is obtained a novel analysis of modality, contrasting, on the one hand, with Carnap's syntactic theory of modality, and, on the other hand, with Lewis's view of modal concepts as underivable from other logical concepts. We would maintain that modal concepts are not absolute, but always relative to some S, generally unspecified.

In the formal exposition which follows, we shall assume tacitly but not explicitly the important distinction between the symbols we are discussing and symbols denoting or designating the former.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1937

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

Post, E. L.. Introduction to a general theory of elementary propositions. American journal of mathematics, vol. 43 (1921), pp. 163185.CrossRefGoogle Scholar
Lewis, C. I. and Langford, C. H.. Symbolic logic. New York 1932.Google Scholar
Abraham, Leo. Implication, modality and intension in symbolic logic. The monist, vol. 43 (1933), pp. 119153.CrossRefGoogle Scholar
Fitch, F. B.. Note on Leo Abraham's “transformations” of strict implication. The monist, vol. 43 (1933), pp. 297298.CrossRefGoogle Scholar
Wajsberg, M.. Ein erweiterter Klassenkalkül. Monatshefte für Mathematik und Physik, vol. 40 (1933), pp. 113126.CrossRefGoogle Scholar
Bronstein, D. J. and Tarter, Harry. Review of Lewis and Langford's Symbolic logic. The philosophical review, vol. 43 (1934), pp. 305309. Also: Possibility and implication; a reply. The philosophical review, vol. 44 (1935), pp. 69–71.CrossRefGoogle Scholar
McKinsey, J. C. C.. A note on Bronstein's and Tarter's definition of strict implication. The philosophical review, vol. 43 (1934), pp. 518520.CrossRefGoogle Scholar
Huntington, E. V.. Postulates for assertion, conjunction, negation, and equality. Proceedings of the American Academy of Arts and Sciences, vol. 72 (1937), pp. 144.CrossRefGoogle Scholar
Carnap, Rudolf. The logical syntax of language. New York and London 1937.Google Scholar