The author describes an interpreted modal language and produces some clear examples of logical and analytic truths that are not necessary. These examples: (a) are far simpler than the ones cited in the literature, (b) show that a popular conception of logical truth in modal languages is incorrect, and (c) show that there are contingent truths knowable ``a priori'' that do not depend on fixing the reference of a term.

In this paper we show that, in Gentzen systems, there is a close relation between two of the main characters in algebraic logic and proof theory respectively: protoalgebraicity and the cut rule. We give certain conditions under which a Gentzen system is protoalgebraic if and only if it possesses the cut rule. To obtain this equivalence, we limit our discussion to what we call regular sequent calculi, which are those comprising some of the structural rules and some logical rules, in (...) a sense we make precise. We note that this restricted set of rules includes all the usual rules in the literature. We also stress the difference between the case of two-sided sequents and the case of many-sided sequents, in which more conditions are needed. (shrink)

Frank Jackson champions the cause of conceptual analysis as central to philosophical inquiry. In recent years conceptual analysis has been undervalued and widely misunderstood, suggests Jackson. He argues that such analysis is mistakenly clouded in mystery, preventing a whole range of important questions from being productively addressed. He anchors his argument in discussions of specific philosophical issues, starting with the metaphysical doctrine of physicalism and moving on, via free will, meaning, personal identity, motion, and change, to ethics and the philosophy (...) of color. In this way the book not only offers a methodological program for philosophy, but also casts new light on some much-debated problems and their interrelations. (shrink)

Modal sentences of the form "every F might be G" and "some F must be G" have a threefold ambiguity. in addition to the familiar readings "de dicto" and "de re", there is a third reading on which they are examples of the "plural de re": they attribute a modal property to the F's plurally in a way that cannot in general be reduced to an attribution of modal properties to the individual F's. The plural "de re" readings of modal (...) sentences cannot be captured within standard quantified modal logic. I consider various strategies for extending standard quantified modal logic so as to provide analyses of the readings in question. I argue that the ambiguity in question is associated with the scope of the general term 'F'; and that plural quantifiers can be introduced for purposes of representing the scope of a general term. Moreover, plural quantifiers provide the only fully adequate solution that keeps within the framework of quantified modal logic. (shrink)

§1. Introduction. By means of what semantic features is a proper name tied to its bearer? This is a puzzling question indeed: proper names — like “Aristotle” or “Paris” — are syntactically simple, and it therefore does not seem possible to reduce their meanings, by means of a principle of compositionality, to the meanings of more basic, and hence perhaps more tractable, linguistic elements.

Simple finite axiomatizations are given for versions of the modal logics K and K4 with non-contingency (or contingency) as the sole modal primitive. This answers two questions of I. L. Humberstone.

The well-known argument of Frederick Fitch, purporting to show that verificationism (= Truth implies knowability) entails the absurd conclusion that all the truths are known, has been disarmed by Dorothy Edgington''s suggestion that the proper formulation of verificationism presupposes that we make use of anactuality operator along with the standardly invoked epistemic and modal operators. According to her interpretation of verificationism, the actual truth of a proposition implies that it could be known in some possible situation that the proposition holds (...) in theactual situation. Thus, suppose that our object language contains the operatorA — it is actually the case that ... — with the following truth condition: vA iff w0, wherew 0 stands for the designated world of the model — the actual world. Then we can formalize the verificationist claim as follows. (shrink)

The question, "Which modal logic is the right one for logical necessity?," divides into two questions, one about model-theoretic validity, the other about proof-theoretic demonstrability. The arguments of Halldén and others that the right validity argument is S5, and the right demonstrability logic includes S4, are reviewed, and certain common objections are argued to be fallacious. A new argument, based on work of Supecki and Bryll, is presented for the claim that the right demonstrability logic must be contained in S5, (...) and a more speculative argument for the claim that it does not include S4.2 is also presented. (shrink)

The logics of the modal operators and of the quantifiers show striking analogies. The analogies are so extensive that, when a special class of entities (possible worlds) is postulated, natural and non-arbitrary translation procedures can be defined from the language with the modal operators into a purely quantificational one, under which the necessity and possibility operators translate into universal and existential quantifiers. In view of this I would be willing to classify the modal operators as ‘disguised’ quantifiers, and I think (...) that wholehearted acceptance of modal language should be considered to carry ontological commitment to something like possible worldsConsidered as two languages for describing the same subject matter, modal and purely quantificational languages show interesting differences. The operator variables of the purely quantificational languages give them more power than the modal languages, but at least some of the functions performed by the apparatus of operator variables are also performed, in a more primitive and less versatile way, by actuality operators in modal languages.A final note. Quine has written much on the inter-relations of quantifiers, identity, and the concept of existence. These, he holds, form a tightly knit conceptual system which has been evolved to a high point of perfection, but which might conceivably change yet further.29 He has also dropped hints about the possibility of a simpler, primitive or defective version of the system, in which the quantifiers are not backed up in their accustomed way by the concept of identity. He has dubbed the resulting concept a ‘pre-individuative’ concept of existence, or a concept of ‘entity without identity.’ What would a pre-individuative concept of existence be like? Quine has sometimes suggested that one might be embodied in the use of mass nouns, but the identity concept is used in connection with stuff as well as with things: “is that the same coffee that was in the cup last night?” I would submit that modality provides a better case. In view of the comparative weakness of modal languages, compared to the explicitly quantificational ones Quine takes as canonical, there is surely a sense in which the concept of existence embodied in that disguised existential quantifier, the possibility operator, is a defective one. And as we have seen, one of the differences between modal operators and explicit quantifiers is that modal operators cannot be joined with the identity predicate in the way quantifiers with operator variables can. Surely, then, there is a sense in which ordinary speech, as opposed to the metaphysical theorizing of a Leibniz or a David Lewis, conceives of possible worlds as entities without identity. (shrink)

The main result of the present paper is equivalence of the following conditions, for any k-dimensional logic L : L has a full-replacement implication system, i.e., a finite set of k-dimensional formulas with 2k variables that in a natural way adopts the Identity axiom and the Modus Ponens rule for the ordinary implication connective; L has an unary-replacement implication system, i.e., a finite set of k-dimensional formulas with k+1 variables that in a different way adopts the Identity axiom and the (...) Modus Ponens rule for the ordinary implication connective; L has a parameterized local deduction theorem ; L has the syntactic correspondence property that is essentially the restriction of the filter correspondence property to deductive L-filters over the formula algebra alone; L is protoalgebraic in the sense that the Leibniz operator is monotonic on the set of deductive L -filters over every algebra; L has a system of equivalence formulas with parameters that defines the Leibniz operator on deductive L -filters over every algebra.We also present a family of specific examples which collectively show that the above metaequivalence doesn't remain true when in ``2k'' ``k+1'') is replaced by ``2k-1''. This, in particular, disproves the statement of [4], Theorem 13.2. (shrink)

After defining a standard modal language and semantics, we offer some clear examples of logical and analytic truths that are not necessary. These examples: (a) are far simpler than the ones cited in the literature, (b) show that a popular conception of logical truth in modal languages is incorrect, and (c) show that there are contingent truths knowable ``a priori'' that do not depend on fixing the reference of a term.