The article deals with the interpretation of propositional attitudes in the framework of modal predicate logic. The first part discusses the classical puzzles arising from the interplay between propositional attitudes, quantifiers and the notion of identity. After comparing different reactions to these puzzles it argues in favor of an analysis in which evaluations of de re attitudes may vary relative to the ways of identifying objects used in the context of use. The second part of the article gives this analysis (...) a precise formalization from a model-and proof-theoretic perspective. (shrink)

What precisely are fragments of classical first-order logic showing “modal” behaviour? Perhaps the most influential answer is that of Gabbay 1981, which identifies them with so-called “finite-variable fragments”, using only some fixed finite number of variables (free or bound). This view-point has been endorsed by many authors (cf. van Benthem 1991). We will investigate these fragments, and find that, illuminating and interesting though they are, they lack the required nice behaviour in our sense. (Several new negative results support this claim.) (...) As a counterproposal, then, we define a large fragment of predicate logic characterized by its use of only bounded quantification. This so-called guarded fragment enjoys the above nice properties, including decidability, through an effectively bounded finite model property. (These are new results, obtained by generalizing notions and techniques from modal logic.) Moreover, its own internal finite variable hierarchy turns out to work well. Finally, we shall make another move. The above analogy works both ways. Modal operators are like quantifiers, but quantifiers are also like modal operators. This observation inspires a generalized semantics for first-order predicate logic with accessibility constraints on available assignments (cf. N´emeti 1986, 1992) which moves the earlier quantifier restrictions into the semantics. This provides a fresh look at the landscape of possible predicate logics, including candidates sharing various desirable features with basic modal logic – in particular, its decidability. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula (like (...) FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

As McKinsey and Tarski showed, the Stone representation theorem for Boolean algebras extends to algebras with operators to give topological semantics for (classical) propositional modal logic, in which the operation is modeled by taking the interior of an arbitrary subset of a topological space. In this article, the topological interpretation is extended in a natural way to arbitrary theories of full first-order logic. The resulting system of S4 first-order modal logic is complete with respect to such topological semantics.

The result of combining classical quantificational logic with modal logic proves necessitism – the claim that necessarily everything is necessarily identical to something. This problem is reflected in the purely quantificational theory by theorems such as $\exists xt = x$; it is a theorem, for example, that something is identical to Timothy Williamson. The standard way to avoid these consequences is to weaken the theory of quantification to a certain kind of free logic. However, it has often been noted that (...) in order to specify the truth conditions of certain sentences involving constants or variables that don’t denote, one has to apparently quantify over things that are not identical to anything. In this paper I defend a contingentist, non-Meinongian metaphysics within a positive free logic. I argue that although certain names and free variables do not actually refer to anything, in each case there might have been something they actually refer to, allowing one to interpret the contingentist claims without quantifying over mere possibilia. (shrink)

Four questions are raised about the semantics of Quantified Modal Logic (QML). Does QML admit possible objects, i.e. possibilia? Is it plausible to admit them? Can sense be made of such objects? Is QML committed to the existence of possibilia?The conclusions are that QML, generalized as in Kripke, would seem to accommodate possibilia, but they are rejected on philosophical and semantical grounds. Things must be encounterable, directly nameable and a part of the actual order before they may plausibly enter into (...) the identity relation. QML is not committed to possibiha in that the range of variables may be restricted to actual objects.Support of the conclusions requires some discussion of substitution puzzles; also, the semantical distinction between proper names which are directly referring, and descriptions even where the latter are "rigid designators".Views of W.V. Quine, B. Russell, K. Donnellan, D. Kaplan as well as S. Kripke are invoked or evaluated in conjunction with these issues. (shrink)

In previous work we gave an approach, based on labelled natural deduction, for formalizing proof systems for a large class of propositional modal logics that includes K, D, T, B, S4, S4.2, KD45, and S5. Here we extend this approach to quantified modal logics, providing formalizations for logics with varying, increasing, decreasing, or constant domains. The result is modular with respect to both properties of the accessibility relation in the Kripke frame and the way domains of individuals change between worlds. (...) Our approach has a modular metatheory too; soundness, completeness and normalization are proved uniformly for every logic in our class. Finally, our work leads to a simple implementation of a modal logic theorem prover in a standard logical framework. (shrink)

I develop a formal logic in which quantified arguments occur in argument positions of predicates. This logic also incorporates negative predication, anaphora and converse relation terms, namely, additional syntactic features of natural language. In these and additional respects, it represents the logic of natural language more adequately than does any version of Frege’s Predicate Calculus. I first introduce the system’s main ideas and familiarize it by means of translations of natural language sentences. I then develop a formal system built on (...) these principles, the Quantified Argument Calculus or Quarc. I provide a truth-value assignment semantics and a proof system for the Quarc. I next demonstrate the system’s power by a variety of proofs; I prove its soundness; and I comment on its completeness. I then extend the system to modal logic, again providing a proof system and a truth-value assignment semantics. I proceed to show how the Quarc versions of the Barcan formulas, of their converses and of necessary existence come out straightforwardly invalid, which I argue is an advantage of the modal Quarc over modal Predicate Logic as a system intended to capture the logic of natural language. (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)

It is shown that the modally first-degree formulas of quantificational S5 constitute a reduction class. This is done by defining prenex normal forms for quantificational S5, and then showing that for any formula A there is a formula B in prenex normal form, such that B is modally first-degree and is provable if and only if A is provable.

Consider two standard quantified modal languages A and P whose vocabularies comprise the identity predicate and the existence predicate, each endowed with a standard S5 Kripke semantics where the models have a distinguished actual world, which differ only in that the quantifiers of A are actualist while those of P are possibilist. Is it possible to enrich these languages in the same manner, in a non-trivial way, so that the two resulting languages are equally expressive-i.e., so that for each sentence (...) of one language there is a sentence of the other language such that given any model, the former sentence is true at the actual world of the model iff the latter is? Forbes (1989) shows that this can be done by adding to both languages a pair of sentential operators called Vlach-operators, and imposing a syntactic restriction on their occurrences in formulas. As Forbes himself recognizes, this restriction is somewhat artificial. The first result I establish in this paper is that one gets sameness of expressivity by introducing infinitely many distinct pairs of indexed Vlach-operators. I then study the effect of adding to our enriched modal languages a rigid actuality operator. Finally, I discuss another means of enriching both languages which makes them expressively equivalent, one that exploits devices introduced in Peacocke (1978). Forbes himself mentions that option but does not prove that the resulting languages are equally expressive. I do, and I also compare the Peacockian and the Vlachian methods. In due course, I introduce an alternative notion of expressivity and I compare the Peacockian and the Vlachian languages in terms of that other notion. (shrink)

A general strategy for proving completeness theorems for quantified modal logics is provided. Starting from free quantified modal logic K, with or without identity, extensions obtained either by adding the principle of universal instantiation or the converse of the Barcan formula or the Barcan formula are considered and proved complete in a uniform way. Completeness theorems are also shown for systems with the extended Barcan rule as well as for some quantified extensions of the modal logic B. The incompleteness of (...) Q°.B + BF is also proved. (shrink)

The paper studies first order extensions of classical systems of modal logic (see (Chellas, 1980, part III)). We focus on the role of the Barcan formulas. It is shown that these formulas correspond to fundamental properties of neighborhood frames. The results have interesting applications in epistemic logic. In particular we suggest that the proposed models can be used in order to study monadic operators of probability (Kyburg, 1990) and likelihood (Halpern-Rabin, 1987).

I offer a series of axiomatic formalizations of Divine Command Theory motivated by certain methodological considerations. Given these considerations, I present what I take to be the best axiomatization of Divine Command Theory, an axiomatization which requires a non-standardsemantics for quantified modal logic.

This paper is part of a general programme of developing and investigating particular first-order modal theories. In the paper, a modal theory of propositions is constructed under the assumption that there are genuinely singular propositions, ie. ones that contain individuals as constituents. Various results on decidability, axiomatizability and definability are established.

Propositional modal logic is a standard tool in many disciplines, but ﬁrst-order modal logic is not. There are several reasons for this, including multiplicity of versions and inadequate syntax. In this paper we sketch a syntax and semantics for a natural, well-behaved version of ﬁrst-order modal logic, and show it copes easily with several familiar diﬃculties. And we provide tableau proof rules to go with the semantics, rules that are, at least in principle, automatable.

An interpolation theorem holds for many standard modal logics, but ﬁrst order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a ﬁrst order S5 interpolation theorem can be proved provided the logic is extended to contain propositional quantiﬁers. A proper statement of the result involves some subtleties, but this is the essence of it.

Timothy Williamson has argued that in the debate on modal ontology, the familiar distinction between actualism and possibilism should be replaced by a distinction between positions he calls contingentism and necessitism. He has also argued in favor of necessitism, using results on quantified modal logic with plurally interpreted second-order quantifiers showing that necessitists can draw distinctions contingentists cannot draw. Some of these results are similar to well-known results on the relative expressivity of quantified modal logics with so-called inner and outer (...) quantifiers. The present paper deals with these issues in the context of quantified modal logics with generalized quantifiers. Its main aim is to establish two results for such a logic: Firstly, contingentists can draw the distinctions necessitists can draw if and only if the logic with inner quantifiers is at least as expressive as the logic with outer quantifiers, and necessitists can draw the distinctions contingentists can draw if and only if the logic with outer quantifiers is at least as expressive as the logic with inner quantifiers. Secondly, the former two items are the case if and only if all of the generalized quantifiers are first-order definable, and the latter two items are the case if and only if first-order logic with these generalized quantifiers relativizes. (shrink)

Quantified modal logic (QML) has reputation for complexity. Completeness results for the various systems appear piecemeal. Different tactics are used for different systems, and success of a given method seems sensitive to many factors, including the specific combination of choices made for the quantifiers, terms, identity, and the strength of the underlying propositional modal logic. The lack of a unified framework in which to view QMLs and their completeness properties puts pressure on those who develop, apply, and teach QML to (...) work with the (allegedly) simplest systems, namely those that adopt the Barcan Formulas and predicate logic rules for the quantifiers. In these systems, the quantifier ranges over a fixed domain of possible individuals, so advocates of these logics are sometimes called possibilists. A literature has grown up rationalizing the choice of possibilist logics despite ordinary intuitions that the resulting theorems are too strong (Cresswell, 1991; Linsky and Zalta, 1994).Williamson (1998, p. 262) even takes the view that the complications to be faced within the weaker logics “are a warning sign of philosophical error”. It is the purpose of this paper to show that abandonment of the weaker QMLs is excessively fainthearted, since most QMLs can be given relatively simple formulations within one general framework. Given the straightforward nature of the systems and their completeness results, the purported complications evaporate, along with any philosophical warnings one might have associated with them. (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)

There has been very little discussion of the appropriate principles to govern a modal logic of plurals. What debate there has been has accepted a principle I call (Necinc); informally if this is one of those then, necessarily: this is one of those. On this basis Williamson has criticised the Boolosian plural interpretation of monadic second-order logic. I argue against (Necinc), noting that it isn't a theorem of any logic resulting from adding modal axioms to the plural logic PFO+, and (...) showing that the most obvious formal argument in its favour is question begging. I go on to discuss the behaviour of natural language plurals, motivating a case against (Necinc) by developing a case that natural language plural terms are not de jure rigid designators. The paper concludes by developing a model theory for modal PFO-f which does not validate (Necinc). An Appendix discusses (Necinc) in relation to counterpart theory. Of course, it would be a mistake to think that the rules for "multiple pointing" follow automatically from the rules for pointing proper. Max Black—The Elusiveness of Sets In some influential articles during the 1980s George Boolos proposed an interpretation of monadic second-order logic in terms of plural quantification [4, 5]. One objection to this proposal, pressed by Williamson [22, 456-7], focuses on the modal behaviour of plural variables, arguing that the proposed interpretation yields the wrong results in respect of the modal status of atomic predications. In the present paper I will present this objection and argue against it. In the course of developing the argument, I will have cause to consider the under-investigated question of how a logic for plurals should be extended to incorporate modal operators. (shrink)

Epistemic modal predicate logic raises conceptual problems not faced in the case of alethic modal predicate logic: Frege’s “Hesperus-Phosphorus” problem—how to make sense of ascribing to agents ignorance of necessarily true identity statements—and the related “Hintikka-Kripke” problem—how to set up a logical system combining epistemic and alethic modalities, as well as others problems, such as Quine’s “Double Vision” problem and problems of self-knowledge. In this paper, we lay out a philosophical approach to epistemic predicate logic, implemented formally in Melvin Fitting’s (...) First-Order Intensional Logic, that we argue solves these and other conceptual problems. Topics covered include: Quine on the “collapse” of modal distinctions; the rigidity of names; belief reports and unarticulated constituents; epistemic roles; counterfactual attitudes; representational vs. interpretational semantics; ignorance of co-reference vs. ignorance of identity; two-dimensional epistemic models; quantification into epistemic contexts; and an approach to multi-agent epistemic logic based on centered worlds and hybrid logic. (shrink)

This paper outlines a formal account of tensed sentences that is consistent with Ockhamism, a view according to which future contingents are either true or false. The account outlined substantively differs from the attempts that have been made so far to provide a formal apparatus for such a view in terms of some expressly modified version of branching time semantics. The system on which it is based is the simplest quantified modal logic.

This paper makes a point about the interpretation of the simplest quantified modal logic, that is, quantified modal logic with a single domain. It is commonly assumed that the domain in question is to be understood as the set of all possibile objects. The point of the paper is that this assumption is misguided.

A first-order logic of belief with identity is proposed, primarily to give an account of possible de re contradictory beliefs, which sometimes occur as consequences of de dicto non-contradictory beliefs. A model has two separate, though interconnected domains: the domain of objects and the domain of appearances. The satisfaction of atomic formulas is defined by a particular S-accessibility relation between worlds. Identity is non-classical, and is conceived as an equivalence relation having the classical identity relation as a subset. A tableau (...) system with labels, signs, and suffixes is defined, extending the basic language $\mathscr{L}_{\mathbf{QB}}$ by quasiformulas (to express the denotations of predicates). The proposed logical system is paraconsistent since $\phi \wedge \neg\phi$ does not ``explode'' with arbitrary syntactic consequences. (shrink)

The simplest quantified modal logic combines classical quantification theory with the propositional modal logic K. The models of simple QML relativize predication to possible worlds and treat the quantifier as ranging over a single fixed domain of objects. But this simple QML has features that are objectionable to actualists. By contrast, Kripke-models, with their varying domains and restricted quantifiers, seem to eliminate these features. But in fact, Kripke-models also have features to which actualists object. Though these philosophers have introduced variations (...) on Kripke-models to eliminate their objectionable features, the most well-known variations all have difficulties of their own. The present authors reexamine simple QML and discover that, in addition to having a possibilist interpretation, it has an actualist interpretation as well. By introducing a new sort of existing abstract entity, the contingently nonconcrete, they show that the seeming drawbacks of the simplest QML are not drawbacks at all. Thus, simple QML is independent of certain metaphysical questions. (shrink)