In spite of the philosophical significance of higher-order modal logic, the modal logician's main concern has been with sentential logic. In this paper we do not intend to go into philosophical details, but we only remark that higher-order modal logic has a close relationship with Montague's well-known idea of “universal grammar”, which is an ambitious attempt to build a logical theory of natural languages with exact syntax and semantics, comparable with the artificial languages of mathematical logic. For this matter, the (...) reader can consult, e.g., Montague [8], [9] and Gallin [2]. (shrink)

Four progressively ambitious systems of modal propositional logic are set forth, together with decision procedures. The simultaneous employment of parenthesis notation and parenthesis-free notation, the dual use of symbols as primitive and defined, and the introduction of a new modal operator (the truth operator) are the principal devices used to effect the development of these logics. The first two logics turn out to be "the same" as two of von Wright's systems.

Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a way that (...) restricts its use to cases in which the premiss does not depend on assumptions. This restriction is entirely analogous to the restriction of the rule of universal generalization of first-order logic. A necessitation rule with this restriction permits a proof of the deduction theorem in its usual formulation. Other suggestions presented in the literature to deal with the problem are reviewed, and the present solution is argued to be preferable to the other alternatives. A contraction-and cut-free sequent calculus equivalent to the Hubert system for basic modal logic shows the standard failure argument untenable by proving the underivability of DA from A. (shrink)

Natural deduction is the type of logic most familiar to current philosophers, and indeed is all that many modern philosophers know about logic. Yet natural deduction is a fairly recent innovation in logic, dating from Gentzen and Jaśkowski in 1934. This article traces the development of natural deduction from the view that these founders embraced to the widespread acceptance of the method in the 1960s. I focus especially on the different choices made by writers of elementary textbooks—the standard conduits of (...) the method to a generation of philosophers—with an eye to determining what the ‘essential characteristics’ of natural deduction are. (shrink)

This article traces the development of possible worlds semantics through the work of: Wittgenstein, 1913-1921; Feys, 1924; McKinsey, 1945; Carnap, 1945-1947; McKinsey, Tarski and Jónsson, 1947-1952; von Wright, 1951; Becker, 1952; Prior, 1953-1954; Montague, 1955; Meredith and Prior, 1956; Geach, 1960; Smiley, 1955-1957; Kanger, 1957; Hintikka, 1957; Guillaume, 1958; Binkley, 1958; Bayart, 1958-1959; Drake, 1959-1961; Kripke, 1958-1965.

In this paper we introduce a system S5U, formed by adding to the modal system S5 a new connective U, Up being read “probably”. A few theorems are derived in S5U, and the system is provided with a decision procedure. Several decidable extensions of S5U are discussed, and probability logic is related to plurality quantification.

Special issue: "Reflecting on the Legacy of C.I. Lewis: Contemporary and Historical Perspectives on Modal Logic".