In this paper I shall present some of the results I have obtained on modal theories which contain quantifiers for propositions. The paper is in two parts: in the first part I consider theories whose non-quantificational part is S5; in the second part I consider theories whose non-quantificational part is weaker than or not contained in S5. Unless otherwise stated, each theory has the same language L. This consists of a countable set V of propositional variables pl, pa, (...) ... , the operators v (or), ~ (not) and □ (necessarily), the universal quantifier (p), p a propositional variable, and brackets ( and ). The formulas of L are then defined in the usual way. (shrink)

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers ∀p, ∃p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (Kremer, 1997). It is shown that if the Kripke structures are restricted to trees of at height and width (...) at most ω, the resulting logics are decidable. This provides a partial answer to a question by Kremer. The result also transfers to modal S4 and some Gödel-Dummett logics with quantifiers over propositions. (shrink)

Many systems of quantified modal logic cannot be characterised by Kripke's well-known possible worlds semantic analysis. This book shows how they can be characterised by a more general 'admissible semantics', using models in which there is a restriction on which sets of worlds count as propositions. This requires a new interpretation of quantifiers that takes into account the admissibility of propositions. The author sheds new light on the celebrated Barcan Formula, whose role becomes that of legitimising the (...) Kripkean interpretation of quantification. The theory is worked out for systems with quantifiers ranging over actual objects, and over all possibilia, and for logics with existence and identity predicates and definite descriptions. The final chapter develops a new admissible 'cover semantics' for propositional and quantified relevant logic, adapting ideas from the Kripke-Joyal semantics for intuitionistic logic in topos theory. This book is for mathematical or philosophical logicians, computer scientists and linguists. (shrink)

We investigate uniform interpolants in propositional modal logics from the proof-theoretical point of view. Our approach is adopted from Pitts’ proof of uniform interpolationin intuitionistic propositional logic [15]. The method is based on a simulation of certain quantifiers ranging over propositional variables and uses a terminating sequent calculus for which structural rules are admissible.

Propositional modal logic over relational frames is naturally extended with propositional quantifiers by letting them range over arbitrary sets of worlds of the relevant frame. This is also known as second-order propositional modal logic. The propositionally quantified modal logic of a class of relational frames is often not axiomatizable, although there are known exceptions, most notably the case of frames validating the strong modal logic $\mathrm {S5}$. Here, we (...) develop new general methods with which many of the open questions in this area can be answered. We illustrate the usefulness of these methods by applying them to a range of examples, which provide a detailed picture of which normal modal logics define classes of relational frames whose propositionally quantified modal logic is axiomatizable. We also apply these methods to establish new results in the multimodal case. (shrink)

We consider second-order propositional modal logic (SOPML), an extension of the basic modal language with propositional quantifiers introduced by Kit Fine in 1970. We determine the precise expressive power of SOPML by giving analogues of the Van Benthem–Rosen theorem and the Goldblatt Thomason theorem. Furthermore, we show that the basic modal language is the bisimulation invariant fragment of SOPML, and we characterize the bounded fragment of first-order logic as being the intersection of first-order (...) logic and SOPML. (shrink)

We consider second-order propositional modal logic (SOPML), an extension of the basic modal language with propositional quantifiers introduced by Kit Fine in 1970. We determine the precise expressive power of SOPML by giving analogues of the Van Benthem–Rosen theorem and the Goldblatt Thomason theorem. Furthermore, we show that the basic modal language is the bisimulation invariant fragment of SOPML, and we characterize the bounded fragment of first-order logic as being the intersection of first-order (...) logic and SOPML. (shrink)

I am interested in extending modal calculi by adding propositional quantifiers, given by the rules for quantifier introduction: provided that p does not occur free in A.

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)

Although first-order Kripke semantics has become a well established branch of modal logic, very little - almost nothing - is written about logics with a weaker modal fragment. We try to help the situation by isolating principles determining the interaction between quantifiers and modalities in minimal semantics. First, we let the standard-model properties of monotonic and anti-monotonic domains clue us in on how to do this – i. e. we try to articulate, in terms of the inclusiveness (...) of the domains of a certain set of worlds, a set of semantical restrictions that will validate the Barcan and converse Barcan formulae respectively. As it turns out, this can indeed by done, but only by adding assumptions strong enough to make the models virtually normal. Since the whole point of switching to a minimal framework would be to generalise the logic, we therefore abandon the worlds-objects thinking altogether, and switch to a much simpler and more direct validation strategy in which the propositions we are after are simply picked out as such. (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)

We present a general approach to quantified modal logics that can simulate most other approaches. The language is based on operators indexed by terms which allow to express de re modalities and to control the interaction of modalities with the first-order machinery and with non-rigid designators. The semantics is based on a primitive counterpart relation holding between n-tuples of objects inhabiting possible worlds. This allows an object to be represented by one, many, or no object in an accessible (...) world. Moreover by taking as primitive a relation between n-tuples we avoid some shortcoming of standard individual counterparts. Finally, we use cut-free labelled sequent calculi to give a proof-theoretic characterisation of the quantified extensions of each first-order definable propositional modal logic. In this way we show how to complete many axiomatically incomplete quantified modal logics. (shrink)

In the first part of this paper we analyzed finite non-deterministic matrix semantics for propositional non-normal modal logics as an alternative to the standard Kripke possible world semantics. This kind of modal system characterized by finite non-deterministic matrices was originally proposed by Ju. Ivlev in the 70s. The aim of this second paper is to introduce a formal non-deterministic semantical framework for the quantified versions of some Ivlev-like non-normal modal logics. It will be shown that (...) several well-known controversial issues of quantified modal logics, relative to the identity predicate, Barcan’s formulas and de re and de dicto modalities, can be tackled from a new angle within the present framework. (shrink)

Quantified modal logic 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 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.Williamson 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)

This article concerns the treatment of propositional quantification in a framework of labelled natural deduction for modal logic developed by Basin, Matthews and Viganò. We provide a detailed analysis of a basic calculus that can be used for a proof-theoretic rendering of minimal normal multimodal systems with quantification over stable domains of propositions. Furthermore, we consider variations of the basic calculus obtained via relational theories and domain theories allowing for quantification over possibly unstable domains of propositions. The (...) main result of the article is that fragments of the labelled calculi not exploiting reductio ad absurdum enjoy the Church–Rosser property and the strong normalization property; such result is obtained by combining Girard’s method of reducibility candidates and labelled languages of lambda calculus codifying the structure of modal proofs. (shrink)

The Moral Law is fulfilled iff everything that ought to be the case is the case, and The Good is realised in a possible world w at a time t iff w is deontically accessible from w at t. In this paper, I will introduce a set of temporal modal deontic systems with propositional quantifiers that can be used to prove some interesting theorems about The Moral Law and The Good. First, I will describe a set of systems (...) without any propositional quantifiers. Then, I will show how these systems can be extended by a couple of propositional quantifiers. I will use a kind of TxW semantics to describe the systems semantically and semantic tableaux to describe them syntactically. Every system will include a constant · that stands for The Good. ‘·’ is read as ‘The Good is realised’. All systems that contain the propositional quantifiers will also include a constant '*' that stands for The Moral Law. '*' is read as ‘The Moral Law is fulfilled’. I will prove that all systems (without the propositional quantifiers) are sound and complete with respect to their semantics and that all systems (including the extended systems) are sound with respect to their semantics. It is left as an open question whether or not the extended systems are complete. (shrink)

According to many actualists, propositions, singular propositions in particular, are structurally complex, that is, roughly, (i) they have, in some sense, an internal structure that corresponds rather directly to the syntactic structure of the sentences that express them, and (ii) the metaphysical components, or constituents, of that structure are the semantic values — the meanings — of the corresponding syntactic components of those sentences. Given that reference is "direct", i.e., that the meaning of a name is its denotation, an apparent (...) consequence of this view is that any proposition expressed by a sentence containing a name that denotes a contingent being S is itself contingent — notably, the proposition [S does not exist]. Assuming that an entity must exist to have a property, necessarily, [S does not exist] must exist in order to be true. It seems to follow that, necessarily, [S does not exist] is not true and, hence, that S is not contingent after all. Past approaches to the problem — notably, those of Prior and Adams — lead to highly undesirable consequences for quantified modal logic. In this paper, several solutions to this puzzle are developed that preserve actualism, the structured view of propositions, the direct theory of reference, and the intuition that [S does not exist] is indeed possible without the adverse consequences for QML of previous solutions. (shrink)

Montague, Prior, von Wright and others drew attention to resemblances between modal operators and quantifiers. In this paper we show that classical quantifiers can, in fact, be regarded as S5-like operators in a purely propositional modal logic. This logic is axiomatized and some interesting fragments of it are investigated.

This article studies seriously actualistic quantified modal logics. A key component of the language is an abstraction operator by means of which predicates can be created out of complex formulas. This facilitates proof of a uniform substitution theorem: if a sentence is logically true, then any sentence that results from substituting a predicate abstract for each occurrence of a simple predicate abstract is also logically true. This solves a problem identified by Kripke early in the modern semantic study (...) of quantified modal logic. A tableau proof system is presented and proved sound and complete with respect to logical truth. The main focus is on seriously actualistic T, an extension of T, but the results established hold also for systems based on other propositional modal logics. Following Menzel it is shown that the formal language studied also supports an actualistic account of truth simpliciter. (shrink)

It is commonplace to formalize propositions involving essential properties of objects in a language containing modal operators and quantifiers. Assuming David Lewis’s counterpart theory as a semantic framework for quantified modal logic, I will show that certain statements discussed in the metaphysics of modality de re, such as the sufficiency condition for essential properties, cannot be faithfully formalized. A natural modification of Lewis’s translation scheme seems to be an obvious solution but is not acceptable for various (...) reasons. Consequently, the only safe way to express some intuitions regarding essential properties is to use directly the language of counterpart theory without modal operators. (shrink)

It has been alleged that actualism and quantified modal logic are incompatible. My aim in this dissertation is twofold: to defend thoroughgoing actualism with respect to possible objects, and to present a modified semantics for quantified modal logic that is compatible with such a position. The basic strategy is to draw on the parallels between fictions and possible worlds to develop a hierarchical system of worlds-within-worlds ;Actualists usually take first-order modal statements as being (...) about the right objects, by stipulation. Any actualistically acceptable semantics must extend this approach to higher-order modal statements. "I could have had a brother who was a banker but could have been a pianist" means: there is a first-order world in which I have a banker brother, and there exists within that world a second-order world in which that very brother is a pianist. This eliminates the troubling need to identify non-actual objects across worlds of the same order. ;The concept of worlds-within-worlds is analogous to that of consistent fictions-within-fictions. Independent investigations of each concept reveal that both nesting structures are treelike, irreflexive and intransitive. Despite these restrictions, AA models are relatively tractable, being derivable from Kripke models for by unraveling. They are sound and complete for normal propositional modal logics, and for the quantified modal logic Q1R as long as constants are excluded from the language. ;In Chapter 1, I argue for actualism and against some proposed responses to the iterated modality problem. I then present the idea of nested worlds as a solution. Chapter 2 examines the analogous concept of nested fictions, to shed some light on consistent nesting structures. Chapter 3 returns to modality proper; AA models are defined and defended for both propositional and quantified modal logic. Chapter 4 contains the soundness and completeness results, and ends with a somewhat surprising philosophical argument motivated by AA semantics: unless it is metaphysically necessary that all objects have sufficient essences, the correct logic for metaphysical necessity must be weaker than B. (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 uses an "admissible set semantics" to treat quantification in quantified modal logics. The truth condition for the universal quantifier states that a universally quantified statement (x)A(x) is true at a world w if and only if there is some proposition true at that world that entails every instance of A(x). It is shown that, for any canonical propositional modal logic the corresponding admissible set semantics characterises the quantified version of that (...) class='Hi'>modal logic. (shrink)

The paper presents a family of propositional epistemic logics such that languages of these logics are extended by quantification over modal operators or over agents of knowledge and extended by predicate symbols that take modal operators as arguments. Denote this family by \}\). There exist epistemic logics whose languages have the above mentioned properties :311–350, 1995; Lomuscio and Colombetti in Proceedings of ATAL 1996. Lecture Notes in Computer Science, vol 1193, pp 71–85, 1996). But these logics are (...) obtained from first-order modal logics, while a logic of \}\) can be regarded as a propositional multi-modal logic whose language includes quantifiers over modal operators and predicate symbols that take modal operators as arguments. Among the logics of \}\) there are logics with a syntactical distinction between two readings of epistemic sentences: de dicto and de re. We show the decidability of logics of \}\) with the help of the loosely guarded fragment of first-order logic. Namely, we generalize LGF to a higher-order decidable loosely guarded fragment. The latter fragment allows us to construct various decidable propositional epistemic logics with quantification over modal operators. The family of this logics coincides with \}\). There are decidable propositional logics such that these logics implicitly contain quantification over agents of knowledge, but languages of these logics are usual propositional epistemic languages without quantifiers and predicate symbols :345–378, 1993). Some logics of \}\) can be regarded as counterparts of logics defined in Grove and Halpern :345–378, 1993). We prove that the satisfiability problem for these logics of \}\) is Pspace-complete using their counterparts in Grove and Halpern :345–378, 1993). (shrink)

In two of the earliest papers on extending modal logic with propositional quantifiers, R. A. Bull and K. Fine studied a modal logic S5Π extending S5 with axioms and rules for propositional quantification. Surprisingly, there seems to have been no proof in the literature of the completeness of S5Π with respect to its most natural algebraic semantics, with propositional quantifiers interpreted by meets and joins over all elements in a complete Boolean algebra. In (...) this note, we give such a proof. This result raises the question: For which normal modal logics L can one axiomatize the quantified propositional modal logic determined by the complete modal algebras for L? (shrink)

We study term modal logics, where modalities can be indexed by variables that can be quantified over. We suggest that these logics are appropriate for reasoning about systems of unboundedly many reasoners and define a notion of bisimulation which preserves propositional fragment of term modal logics. Also we show that the propositional fragment is already undecidable but that its monodic fragment is decidable, and expressive enough to include interesting assertions.

There are logics where necessity is defined by means of a given identity connective: \ is a tautology). On the other hand, in many standard modal logics the concept of propositional identity \ can be defined by strict equivalence \}\). All these approaches to modality involve a principle that we call the Collapse Axiom : “There is only one necessary proposition.” In this paper, we consider a notion of PI which relies on the identity axioms of Suszko’s non-Fregean (...) logic SCI. Then S3 proves to be the smallest Lewis modal system where PI can be defined as SE. We extend S3 to a non-Fregean logic with propositional quantifiers such that necessity and PI are integrated as non-interdefinable concepts. CA is not valid and PI refines SE. Models are expansions of SCI-models. We show that SCI-models are Boolean prealgebras, and vice-versa. This associates non-Fregean logic with research on Hyperintensional Semantics. PI equals SE iff models are Boolean algebras and CA holds. A representation result establishes a connection to Fine’s approach to propositional quantifiers and shows that our theories are conservative extensions of S3–S5, respectively. If we exclude the Barcan formula and a related axiom, then the resulting systems are still complete w.r.t. a simpler denotational semantics. (shrink)

In "An Alternative Semantics for Quantified Relevant Logic" (JSL 71 (2006)) we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complete semantics to the quantified extensions, both with and without the Barcan formula, of every proposi- tional modal logic S. If S is canonical our models are based on propositional frames that validate (...) S. We employ frames in which not every set of worlds is an admissible proposition, and an alternative interpretation of the uni- versal quantifier using greatest lower bounds in the lattice of admissible propositions. Our models have a fixed domain of individuals, even in the absence of the Barcan formula. For systems with the Barcan formula it is possible to preserve the usual Tarskian reading of the quantifier, at the expensive of sometimes losing va- lidity of S in the underlying propositional frames. We apply our results to a number of logics, including S4.2, S4M and KW, whose quantified extensions are incomplete for the standard semantics. (shrink)

Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones (...) for ordinary quantifiers. We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π. (shrink)

This paper focuses on three research questions which are connected with combinations of modal logics: Under which conditions can completeness be transferred from a propositional modal logic to its quantificational counterpart ? Does completeness generally transfer from monomodal QMLs to their multimodal combination? Can completeness be transferred from QMLs with rigid designators to those with non-rigid designators? The paper reports some recent results on these questions and provides some new results.

Steinsvold (2020) has provided two semantics for the basic modal language enriched with propositional quantifiers (∀p). We define an extension EM of the system KD45_{\Box} and prove that EM is sound and complete for both semantics. It follows that the two semantics are equivalent.

We show that (contrary to the parallel case of intuitionistic logic, see [7], [4]) there does not exist a translation fromS42 (the propositional modal systemS4 enriched with propositional quantifiers) intoS4 that preserves provability and reduces to identity for Boolean connectives and.

Modal logic, developed as an extension of classical propositional logic and first-order quantification theory, integrates the notions of possibility and necessity and necessary implication. Arguments whose understanding depends on some fundamental knowledge of modal logic have always been important in philosophy of religion, metaphysics, and epistemology. Moreover, modal logic has become increasingly important with the use of the concept of "possible worlds" in these areas. Introductory Modal Logic fills the need (...) for a basic text on modal logic, accessible to students of elementary symbolic logic. Kenneth Konyndyk presents a natural deduction treatment of propositional modal logic and quantified modal logic, historical information about its development, and discussions of the philosophical issues raised by modal logic. Characterized by clear and concrete explanations, appropriate examples, and varied and challenging exercises, Introductory Modal Logic makes both modal logic and the possible-worlds metaphysics readily available to the introductory level student. (shrink)

This paper traces the course of Prior’s struggles with the concepts and phenomena of modality, and the reasoning that led him to his own rather peculiar modal logic Q. I find myself in almost complete agreement with Prior’s intuitions and the arguments that rest upon them. However, I argue that those intuitions do not of themselves lead to Q, but that one must also accept a certain picture of what it is for a proposition to be possible. That (...) picture. though, is not inevitable. Rather, implicit in Prior’s own account is an alternative picture that has already appeared in various guises, most prominently in the work of Adams, Fine, Deutsch, and Almog. I, too, will opt for this alternative, though I will spell it out rather differently than these philosophers. I will then show that, starting with the alternative picture, Prior’s intuitions can lead instead to a much happier and more standard quantified modal logic than Q. The last section of the paper is devoted to the formal development of the logic and its metatheory. (shrink)

Robert Stalnaker has recently advocated propositional contingentism, the claim that it is contingent what propositions there are. He has proposed a philosophical theory of contingency in what propositions there are and sketched a possible worlds model theory for it. In this paper, such models are used to interpret two propositional modal languages: one containing an existential propositional quantifier, and one containing an existential propositional operator. It is shown that the resulting logic containing an existential (...) quantifier is not recursively axiomatizable, as it is recursively isomorphic to second-order logic, and a natural candidate axiomatization for the resulting logic containing an existential operator is shown to be incomplete. (shrink)

In this paper, we introduce an extension of the modal language with what we call the global quantificational modality [∀p]. In essence, this modality combines the propositional quantifier ∀p with the global modality A: [∀p] plays the same role as the compound modality ∀pA. Unlike the propositional quantifier by itself, the global quantificational modality can be straightforwardly interpreted in any Boolean Algebra Expansion (BAE). We present a logic GQM for this language and prove that it is (...) complete with respect to the intended algebraic semantics. This logic enables a conceptual shift, as what have traditionally been called different “modal logics” now become [∀p]-universal theories over the base logic GQM: instead of defining a new logic with an axiom schema such as □φ→□□φ, one reasons in GQM about what follows from the globally quantified formula [∀p](□p→□□p). (shrink)

The language of standard propositional modal logic has one operator (? or ?), that can be thought of as being determined by the quantifiers ? or ?, respectively: for example, a formula of the form ?F is true at a point s just in case all the immediate successors of s verify F.This paper uses a propositional modal language with one operator determined by a generalized quantifier to discuss a simple connection between standard invariance conditions (...) on modal formulas and generalized quantifiers: the combined generalized quantifier conditions of conservativity and extension correspond to the modal condition of invariance under generated submodels, and the modal condition of invariance under bisimulations corresponds to the generalized quantifier being a Boolean combination of ? and ? (shrink)

“Modal logic was conceived in sin: the sin of confusing use and mention.” So quips Quine. The stigma stuck with modal logic for a while. But by the mid-sixties, a whole cluster of mathematically elegant interpretations of modal logic became available. All are natural extensions of the classical Tarskian semantics of predicate logic. By the mid-seventies, Quine’s criticisms seemed obsolete. Today, we teach the model theory of modal logic as a matter (...) of course. Quine’s “interpretive problem” is just forgotten. The purpose of my dissertation is to revamp Quine’s thesis: the very foundations of modal logic—simple propositional modal logic, even before quantifiers are added—are shaky. Quine holds that the natural interpretation of the operator “necessarily” is in terms of a full-blooded metaphysical notion of real necessity. Such a notion, Quine conjectures, is committed to the “metaphysical jungle of Aristotelian essentialism”. Hence, the intended interpretation is to be rejected. Thus Quine: so much the worse for real necessity. An alternative comes to mind: a meta-level, formal rather than real, semantic interpretation of the operator of necessity. In the late forties, Carnap developed this line of interpretation which culminates in the aforementioned model theory (“Kripke’s possible world semantics”) in the sixties. On this basis a formal interpretation is introduced: it grounds necessity in the notion of model theoretic validity. As pointed by friends of the formal interpretation (Marcus, Parsons and Kaplan), no invidious essentialist claim is verified. But have Quine’s concerns been answered? Yes and no. Technical problems regarding quantification across modal operators, substitutivity, matters of scope, and the basis of cross-world identification have indeed been solved. However, no real interpretation of “necessarily” has been provided. I argue that the seeds of such an interpretation are present in Kripke’s philosophical discussion of de re necessities in Naming and Necessity. It is not model theoretic, and it does not reduce necessity to some non-modal notion, just as Quine predicted. Even more in his vein, the real interpretation is (i) metaphysically, grounded indeed in essentialist theses, and (ii) epistemologically, forced to give up Kant’s ideal that all necessities are known a priori. (shrink)

In Symbolic Logic (1932), C. I. Lewis developed five modal systems S1 − S5. S4 and S5 are so-called normal modal systems. Since Lewis and Langford’s pioneering work many other systems of this kind have been investigated, among them the 32 systems that can be generated by the five axioms T, D, B, 4 and 5. Lewis also discusses how his systems can be augmented by propositional quantifiers and how these augmented logics allow us to express (...) some interesting ideas that cannot be expressed in the corresponding quantifier-free logics. In this paper, I will develop 64 normal modal semantic tableau systems that can be extended by propositional quantifiers yielding 64 extended systems. All in all, we will investigate 128 different systems. I will show how these systems can be used to prove some interesting theorems and I will discuss Lewis’s so-called existence postulate and some of its consequences. Finally, I will prove that all normal modal systems are sound and complete and that all systems (including the extended systems) are sound with respect to their semantics. It is left as an open question whether or not the extended systems are complete. (shrink)

By a pure modal logic of names we mean a quantifier-free formulation of such a logic which includes not only traditional categorical, but also modal categorical sentences with modalities de re and which is an extension of Propositional Logic. For categorical sentences we use two interpretations: a “natural” one; and Johnson and Thomason’s interpretation, which is suitable for some reconstructions of Aristotelian modal syllogistic :271–284, 1989; Thomason in J Philos Logic 22:111–128, 1993 (...) and J Philos Logic 26:129–141, 1997. In both cases we use Johnson-like models. We also analyze different kinds of versions of PMLN, for both general and singular names. We present complete tableau systems for the different versions of PMLN. These systems enable us to present some decidability methods. It yields “strong decidability” in the following sense: for every inference starting with a finite set of premises we can specify a finite number of steps to check whether it is logically valid. This method gives the upper bound of the cardinality of models needed for the examination of the validity of a given inference. (shrink)

Propositional quantifiers are added to a propositional modal language with two modal operators. The resulting language is interpreted over so-called products of Kripke frames whose accessibility relations are equivalence relations, letting propositional quantifiers range over the powerset of the set of worlds of the frame. It is first shown that full second-order logic can be recursively embedded in the resulting logic, which entails that the two logics are recursively isomorphic. The embedding is then (...) extended to all sublogics containing the logic of so-called fusions of frames with equivalence relations. This generalizes a result due to Antonelli and Thomason, who construct such an embedding for the logic of such fusions. (shrink)

Since ancient times, philosophers have recognised that truth comes in many 'modes', so that a proposition can be not only true or false, but also, for example, 'necessary' or 'possible'. These ideas led to the modern field of modal logic, a lively area of research at the interface of philosophy, mathematics and computer science. -/- Nowadays, the term 'modal logic' is understood in a broad sense, allowing it to encompass logics for reasoning about seemingly unrelated phenomena (...) such as knowledge, obligations, time, space, and proofs, among many others. Contemporary research in modal logic draws on techniques from many disciplines, including complexity theory, combinatorics, universal algebra, category theory, topology, and proof theory. -/- These proceedings record the papers presented at Advances in Modal Logic 2024, the 15th in a series of biennial conferences that aim to report on important new developments in pure and applied modal logic. Topics in this issue include epistemic modal logic, constructive and many-valued modal logic, unification, alge aic and neighbourhood semantics, proof theory and complexity of modal logics, conditional and quantified modal logic. (shrink)

A defense of an ontology of propositions and of some logical resources for representing them. It begins with an austere formulation of a theory of propositions in a first-order extensional logic, but then uses the commitments of this theory to justify an enrichment to modal logic - the logic of necessity and possibility - as an appropriate framework for regimented languages that are constructed to represent any of our scientific and philosophical commitments. Both the proof-theory and (...) the model theory of a first-order quantified modal logic are developed in detail, and it is argued that these formal resources help to sharpen questions about ontology and predication. The clarification of predication helps to provide a motivation for extending our ontological commitment to properties and relations that are expressed by predicates, and for extending the logic to a higher-order modal logic that provides a conception of metaphysical modality that allows for the contingent existence, not only of persons and physical objects, but also of properties, relations and propositions. Even though both the specific ontological commitments defended (to propositions, properties and relations) and the logical resources that are used to defend them (modal and higher-order logic) were famously rejected by W. V. Quine, the book adopts a self-consciously neo-Quinean methodology, and argues that the theory that is developed helps to motivate and clarify Quine's naturalistic metaphysical picture. (shrink)

A well established technique toward developing the proof theory of a Hilbert-style modal logic is to introduce a Gentzen-style equivalent (a Gentzenisation), then develop the proof theory of the latter, and finally transfer the metatheoretical results to the original logic (e.g., [1, 6, 8, 18, 10, 12]). In the first-order modal case, on one hand we know that the Gentzenisation of the straightforward first-order extension of GL, the logic QGL, admits no cut elimination (if the (...) rule is included as primitive; or, if not included, then the rule is not admissible [1]). On the other hand the (cut-free) Gentzenisations of the first-order modal logics M3 and ML3 of [10, 12] do have cut as an admissible rule. The syntactic cut admissibility proof given in [18] for the Gentzenisation of the propositional provability logic GL is extremely complex, and it was the basis of the proofs of cut admissibility of the Gentzenisations of M3 and ML3, where the presence of quantifiers and quantifier rules added to the complexity and length of the proof. A recent proof of cut admissibility in a cut-free Gentzenisation of GL is given in [5] and is quite short and easy to read. We adapt it here to revisit the proofs for the cases of M3 and ML3, resulting to similarly short and easy to read proofs, only slightly complicated by the presence of quantification and its relevant rules. (shrink)

The history of contemporary modal logic dates back to the writings of C. S. Lewis in the early part of this century. Since then, a growing body of literature has attested to professional interest in the area, and in a number of related issues in philosophical logic which have received wide attention. The recent development of powerful formal techniques for modal system building, together with an increasing interest in modal logic as a tool for (...) philosophical analysis, have created a need for an up-to-date text to introduce students to this material. Snyder's book attempts to answer this need. Assuming an understanding of elementary propositional logic, Snyder introduces a reductive technique called cancellation for detecting the theorems of a system of logic. This technique, analogous to the construction of Smullyan trees but more compact, is extended to modal and quantified contexts. Cancellation versions of the systems M and Mn of G. H. von Wright, and S4 and S5 of Lewis are developed. Snyder uses a Hintikka type of semantics, showing how the various formal systems are differentiated at the semantic level by differing conditions which must be imposed on the model systems used as interpretations for them. These model systems, and the conditions imposed upon them, are in turn described by means of a metalanguage which is essentially first-order quantificational logic. The power of this technique stems from the fact that for every object language formula of a system, there is a corresponding formula in the metalanguage which describes the conditions an interpretation must meet in order to satisfy the original formula. The conditions that the interpretations of a given system of logic must meet are reflected in this metalanguage as "antecedent assumptions," and these in turn correspond to cancellation rules for the object language. This correspondence is constructed in such a way that the metalinguistic counterpart of each theorem of the system will be a theorem of first-order logic. Snyder's primary interest is in showing how modal logic can be used, with the help of these techniques, to build a large variety of formal systems and to "tailor" such systems to meet a variety of analytical tasks. Simple modal systems are developed for the articulation of a number of modal concepts, in addition to the classic alethic ones. Examples are taken from temporal, deontic, and epistemic logic to show how specific interpretations of the meanings of the relevant operators lead to the incorporation of appropriate conditions in the formal systems used to articulate them. An entire chapter is devoted to a discussion of the paradoxes of material and strict implication, and to an attempt to articulate the notion of entailment through the development of formal systems which include a dyadic modal operator that is free of these paradoxes. The final chapter discusses such classical issues as proper names, reference, fictional entities, definite descriptions, and existence presuppositions. Appendices deal with such matters as the equivalence of the cancellation systems to more classical axiomatic-deduction systems, and the sketch of a proof of soundness and completeness for all the modal systems presented. While designed as a text, this volume should be of interest to both logicians and those working in metaphysics and language analysis, since the primary concern of the author is to develop techniques that will facilitate the usefulness of modal logic as a tool for philosophical analysis. The instructor's manual contains many suggestions derived from the author's experience in teaching this non-standard treatment of the subject.--K. T. (shrink)

It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.

Formalizing categorical propositions of traditional logic in the language of quantifiers and propositional functions is no straightforward matter, especially when modalities get involved. Starting...