A Note on Graded Modal Logic

We introduce a notion of bisimulation for graded modal logic. Using this notion, the model theory of graded modal logic can be developed in a uniform manner. We illustrate this by establishing the finite model property and proving invariance and definability results.     

The extent of Russell''s modal views

Russell has recently been held to have had a modal logic, a full modal theory and a view of naming that anticipates Kripke's intuitions on rigid designation. It is argued here that no such claims are warranted. While Russell was not altogether silent on matters modal, he did not advance an identifiable modal logic or anything more than a modest modal theory. His view of naming involves a notion of guaranteed reference. But what Kripke's intuitions about rigidity primarily pertain to is fixed reference, something demonstrably different.     

Quantified modal logic: Non-normal worlds and propositional attitudes

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.     

走向模型论的模态逻辑

增加特定的基数量词,扩张一阶语言,就可以导致实质性地增强语言的表达能力,这样许多超出一阶逻辑范围的数学概念就能得到处理。由于在模型的层次上基本模态逻辑可以看作一阶逻辑的互模拟不变片断,显然它不能处理这些数学概念。因此,增加说明后继状态类上基数概念的模态词,原则上我们就能以模态的方式处理所有基数。我们把讨论各种模型论逻辑的方式转移到模态方面。     

Capturing equilibrium models in modal logic

Here-and-there models and equilibrium models were investigated as a semantical framework for answer-set programming by Pearce, Valverde, Cabalar, Lifschitz, Ferraris and others. The semantics of equilibrium logic is given in an indirect way: the notion of an equilibrium model is defined in terms of quantification over here-and-there models. We here give a direct semantics of equilibrium logic, stated for a modal language embedding the language of equilibrium logic.     

Semantics for Dual Preferential Entailment

We introduce and explore the notion of duality for entailment relations induced by preference orderings on states. We discuss the relationship between these preferential entailment relations from the perspectives of Boolean algebra, inference rules, and modal axiomatisation. Interpreting the preference relations as accessibility relations establishes modular Gödel-Löb logic as a suitable modal framework for rational preferential reasoning.     

Truth Values and Proof Theory

I present an account of truth values for classical logic, intuitionistic logic, and the modal logic S5, in which truth values are not a fundamental category from which the logic is defined, but rather, an idealisation of more fundamental logical features in the proof theory for each system. The result is not a new set of semantic structures, but a new understanding of how the existing semantic structures may be understood in terms of a more fundamental notion of logical consequence.     

Modal Logic As Dialogical Logic

The title reflects my conviction that, viewed semantically,modal logic is fundamentally dialogical; this conviction is based on the key role played by the notion of bisimulation in modal model theory. But this dialogical conception of modal logic does not seem to apply to modal proof theory, which is notoriously messy. Nonetheless, by making use of ideas which trace back to Arthur Prior (notably the use of nominals, special proposition symbols which name worlds) I will show how to lift the dialogical conception to modal proof theory. I argue that this shift to hybrid logic has consequences for both modal and dialogical logic, and I discuss these in detail.     

A Purely Recombinatorial Puzzle

A new puzzle of modal recombination is presented which relies purely on resources of first‐order modal logic. It shows that naive recombinatorial reasoning, which has previously been shown to be inconsistent with various assumptions concerning propositions, sets and classes, leads to inconsistency by itself. The context sensitivity of modal expressions is suggested as the source of the puzzle, and it is argued that it gives us reason to reconsider the assumption that the notion of metaphysical necessity is in good standing.     

Temporal Interaction of Information and Belief

The temporal updating of an agent’s beliefs in response to a flow of information is modeled in a simple modal logic that, for every date t, contains a normal belief operator B _t and a non-normal information operator I _t which is analogous to the ‘only knowing’ operator discussed in the computer science literature. Soundness and completeness of the logic are proved and the relationship between the proposed logic, the AGM theory of belief revision and the notion of plausibility is discussed. A first draft of this paper was presented at the Workshop on Belief Change in Rational Agents: Perspectives from Artificial Intelligence, Philosophy and Economics, Dagstuhl (Germany), August 2005. Special Issue Formal Epistemology II. Edited by Branden Fitelson     

Associative Substitutional Semantics and Quantified Modal Logic

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.     

The preservation of coherence

It is argued that the preservation of truth by an inference relation is of little interest when premiss sets are contradictory. The notion of a level of coherence is introduced and the utility of modal logics in the semantic representation of sets of higher coherence levels is noted. It is shown that this representative role cannot be transferred to first order logic via frame theory since the modal formulae expressing coherence level restrictions are not first order definable. Finally, an inference relation, calledyielding, is introduced which is intermediate between the coherence preservingforcing relation introduced elsewhere by the authors and the coherence destroying, inference relation of classical logic.     

Reasoning About Permitted Announcements

We formalize what it means to have permission to say something. We adapt the dynamic logic of permission by van der Meyden (J Log Comput 6(3):465–479, 1996) to the case where atomic actions are public truthful announcements. We also add a notion of obligation. Our logic is an extension of the logic of public announcements introduced by Plaza (1989) with dynamic modal operators for permission and for obligation. We axiomatize the logic and show that it is decidable.     

Modes of Adjointness

The fact that many modal operators are part of an adjunction is probably folklore since the discovery of adjunctions. On the other hand, the natural idea of a minimal propositional calculus extended with a pair of adjoint operators seems to have been formulated only very recently. This recent research, mainly motivated by applications in computer science, concentrates on technical issues related to the calculi and not on the significance of adjunctions in modal logic. It then seems a worthy enterprise (both for these contemporary topical pursuits and also for historical interest) to trace the concept of adjunction back to the origins of the algebraic semantics of modal logic and to make explicit its ubiquity in this branch of mathematics.     

Systems of modal logic for impossible worlds

The intuitive notion behind the usual semantics of most systems of modal logic is that of ‘possible worlds’. Loosely speaking, an expression is necessary if and only if it holds in all possible worlds; it is possible if and only if it holds in some possible world. Of course, contradictory expressions turn out to hold in no possible worlds, and logically true expressions turn out to hold in every possible world. A method is presented for transforming standard modal systems into systems of modal logic for impossible worlds. To each possible world there corresponds an impossible world such that an expression holds in the impossible world if and only if it does not hold in the possible world. One can then talk about such worlds quite consistently, and there seems to be no logical reason for excluding them from consideration.     

Intuitionistic Autoepistemic Logic

In this paper we address the problem of combining a logic with nonmonotonic modal logic. In particular we study the intuitionistic case. We start from a formal analysis of the notion of intuitionistic consistency via the sequent calculus. The epistemic operator M is interpreted as the consistency operator of intuitionistic logic by introducing intuitionistic stable sets. On the basis of a bimodal structure we also provide a semantics for intuitionistic stable sets.     

Does the deduction theorem fail for modal logic?

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

The many faces of counts-as: A formal analysis of constitutive rules

The paper proposes a logical systematization of the notion of counts-as which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., forms of classification. Moving from this analytical thesis the paper disentangles three semantically different readings of statements of the type “X counts as Y in context c”, from the weaker notion of contextual classification to the stronger notion of constitutive rule. These many ways in which counts-as can be said are formally addressed by making use of modal logic techniques. The resulting framework allows for a formal characterization of all the involved notions and their reciprocal logical relationships.     

Composition as a Kind of Identity

Composition as identity, as I understand it, is a theory of the composite structure of reality. The theory’s underlying logic is irreducibly plural; its fundamental primitive is a generalized identity relation that takes either plural or singular arguments. Strong versions of the theory that incorporate a generalized version of the indiscernibility of identicals are incompatible with the framework of plural logic, and should be rejected. Weak versions of the theory that are based on the idea that composition is merely analogous to (one-one) identity are too weak to be interesting, lacking in metaphysical consequence. I defend a moderate version according to which composition is a kind of identity, and argue that the difference is metaphysically substantial, not merely terminological. I then consider whether the notion of generalized identity, though fundamental, can be elucidated in modal terms by reverse engineering Hume’s Dictum. Unfortunately, for realists about possible worlds, such as myself, who understand Hume’s Dictum in terms of duplicates, the elucidation never gets off the ground; for modal primitivists, the elucidation may succeed in capturing some general notion of identity, but it’s characterization is too general to target the particular notion of identity, tied to classical mereology, that is the object of my theorizing. In the end, I have little to offer the skeptic who claims not to understand the relevant notion of generalized identity, or not to take it to be compulsory in providing an account of the structure of reality.