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)

Horacio Arlo-Costa. First Order Extensions of Classical Systems of Modal Logic: The Role of Barcan Schemas.

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)

This 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.

As McKinsey and Tarksi 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 "necessity" operation is modeled by taking the interior of an arbitrary subset of a topological space. in this paper 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.

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)

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.

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).

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 first-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 first-order modal logic, and show it copes easily with several familiar difficulties. 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 first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first order S5 interpolation theorem can be proved provided the logic is extended to contain propositional quantifiers. A proper statement of the result involves some subtleties, but this is the essence of it.

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)

This paper responds to criticism of the Kripkean account of logical truth in first-order modal logic. The criticism, largely ignored in the literature, claims that when the box and diamond are interpreted as the logical modality operators, the Kripkean account is extensionally incorrect because it fails to reflect the fact that all sentences stating truths about what is logically possible are themselves logically necessary. I defend the Kripkean account by arguing that some true sentences about logical possibility are not logically (...) necessary. (shrink)

According to Hans Kamp and Frank Vlach, the two-dimensional tense operators "now" and "then" are ineliminable in quantified tense logic. This is often adduced as an argument against tense logic, and in favor of an extensional account that makes use of explicit quantification over times. The aim of this paper is to defend tense logic against this attack. It shows that "now" and "then" are eliminable in quantified tense logic, provided we endow it with enough quantificational structure. The operators might (...) not be redundant in some other systems of tense logic, but this merely indicates a lack of quantificational resources and does not show any deep-seated inability of tense logic to express claims about time. The paper closes with a brief discussion of the modal analogue of this issue, which concerns the role of the actuality operator in quantified modal logic. (shrink)

Here I first raise an argument purporting to show that Lewis’ Modal Realism ends up being completely trivial. But although I reject this line, the argument reveals how difficult it is to interpret Lewis’ thesis that possibilia “exist.” Four natural interpretations are considered, yet upon reflection, none appear entirely adequate. In particular, under the three different “concretist” interpretations of ‘exist’, Modal Realism looks insufficient for genuine ontological commitment. Whereas under the “multiverse” interpretation, Modal Realism ends up being incompatible with each (...) of axioms S5 and B. I close by entertaining a more general problem from which the present interpretive issues seem to arise. -/- . (shrink)

In the philosophy of mathematics, indispensability arguments aim to show that we are justified in believing that abstract mathematical objects exist. I wish to defend a particular objection to such arguments that has become increasingly popular recently. It is called instrumental nominalism. I consider the recent versions of this view and conclude that it has yet to be given an adequate formulation. I provide such a formulation and show that it can be used to answer the indispensability arguments. -/- There (...) are two main indispensability arguments in the literature, though one has received nearly all of the attention. They correspond to two ways in which we use mathematics in science and in everyday life. We use mathematical language to help us describe non-mathematical reality; and we use mathematical reasoning to help us perform inferences concerning non-mathematical reality using only a feasible amount of cognitive power. The former use is the starting point of the Quine-Putnam indispensability argument ([Quine, 1980a], [Quine, 1980b], [Quine, 1981a], [Quine, 1981b], [Putnam, 1979a], [Putnam, 1979b]); the latter provides the basis for Ketland’s more recent argument ([Ketland, 2005]). I begin by considering the Quine-Putnam argument and introduce instrumental nominalism to defuse it. Then I show that Ketland’s argument can be defused in a similar way. (shrink)

One way to obtain a comprehensive semantics for various systems of modal logic is to use a general notion of non-normal world. In the present article, a general notion of modal system is considered together with a semantic framework provided by such a general notion of non-normal world. Methodologically, the main purpose of this paper is to provide a logical framework for the study of various modalities, notably prepositional attitudes. Some specific systems are studied together with semantics using non-normal worlds (...) of different kinds. (shrink)

The paper presents an alternative substitutional semantics for first-order modal logic which, in contrast to traditional substitutional (or truth-value) semantics, allows for a fine-grained explanation of the semantical behavior of the terms from which atomic formulae are composed. In contrast to denotational semantics, which is inherently reference-guided, this semantics supports a non-referential conception of modal truth and does not give rise to the problems which pertain to the philosophical interpretation of objectual domains (concerning, e.g., possibilia or trans-world identity). The paper (...) also proposes the notion of modality de nomine as an alternative to the denotational notion of modality de re. (shrink)