Online research in philosophy

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)

In this paper, I first trace 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 will 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)

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)

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)

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.

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)

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)

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)

In an English article (‘On Expressions’) Professor Shen Youding writes, ‘the meaning of a name is not the object which is mentioned by means of it’ (Shen 1992: 11). This remark touches on a big issue that has divided contemporary philosophers of language. On the one side is the Millian (after J.S. Mill), who maintains that the semantic value of a name is the object which it designates, denotes, or refers to (as I use them here, these three terms are (...) interchangeable). [1] On the other side is the Fregean (after Gottlob Frege), who thinks that a name has a sense in addition to a reference. [2] Though Professor Sheng’s remark is too brief for us to claim that he would have been prepared to endorse the Fregean idea, it is clear that he was not a Millian. (shrink)

This chapter begins with a discussion of Kant's theory of judgment-forms. It argues that it is not true in Kant's logic that assertoric or apodeictic judgments imply problematic ones, in the manner in which necessity and truth imply possibility in even the weakest systems of modern modal logic. The chapter then discusses theories of judgment-form after Kant, the theory of quantification, Frege's Begriffsschrift, C. I. Lewis and the beginnings of modern modal logic, the proof-theoretic approach (...) to modal logic, possible world semantics, correspondence theory, and modality and quantification. (shrink)

In this work we propose an encoding of Reiter’s Situation Calculus solution to the frame problem into the framework of a simple multimodal logic of actions. In particular we present the modal counterpart of the regression technique. This gives us a theorem proving method for a relevant fragment of our modal logic.

The purpose of the present note is to advertise an interesting conjecture concerning a well-known translation in modal logic, by confirming a (highly restricted) special case of the conjecture.

Designed for use by philosophy students, this book provides an accessible, yet technically sound treatment of modal logic and its philosophical applications. Every effort has been made to simplify the presentation by using diagrams in place of more complex mathematical apparatus. These and other innovations provide philosophers with easy access to a rich variety of topics in modal logic, including a full coverage of quantified modal logic, non-rigid designators, definite descriptions, and the de-re (...) de-dictio distinction. Discussion of philosophical issues concerning the development of modal logic is woven into the text. The book uses natural deduction systems and also includes a diagram technique that extends the method of truth trees to modal logic. This feature provides a foundation for a novel method for showing completeness, one that is easy to extend to systems that include quantifiers. (shrink)

Pace Necessitism – roughly, the view that existence is not contingent – essential properties provide necessary conditions for the existence of objects. Sufficiency properties, by contrast, provide sufficient conditions, and individual essences provide necessary and sufficient conditions. This paper explains how these kinds of properties can be used to illuminate the ontological status of merely possible objects and to construct a respectable possibilist ontology. The paper also reviews two points of interaction between essentialism and modal logic. First, we (...) will briefly see the challenge that arises against S4 from flexible essential properties; as well as the moves available to block it. After this, the emphasis is put on the Barcan Formula (BF), and on why it is problematic for essentialists. As we will see, Necessitism can accommodate both (BF) and essential properties. What necessitists cannot do at the same time is to continue to understanding essential properties as providing necessary conditions for the existence of individuals; against what might be for some a truism. (shrink)

In this note, I show how Christian List's modal logic of republican freedom (as published in this journal in 2006) can be extended (1) to grasp the differences between liberal freedom (noninterference) and republican freedom (non-domination) in terms of two purely logical axioms and (2) to cover a more recent definition of republican freedom in terms of `arbitrary interference' that gains popularity in the literature.

Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In general, our Translation Manual gives rise to translations that are exponentially longer than their originals. This fact raises (...) the question whether there are three-valued logics for which there is a shorter translation into S5. The answer is affirmative: we present an elegant linear translation of the Logic of Paradox and of Strong Three-valued Logic into S5. (shrink)

The present paper provides novel results on the model theory of Independence friendly modal logic. We concentrate on its particularly well-behaved fragment that was introduced in Tulenheimo and Sevenster (Advances in Modal Logic, 2006). Here we refer to this fragment as ‘Simple IF modal logic’ (IFML s ). A model-theoretic criterion is presented which serves to tell when a formula of IFML s is not equivalent to any formula of basic modal logic (...) (ML). We generalize the notion of bisimulation familiar from ML; the resulting asymmetric simulation concept is used to prove that IFML s is not closed under complementation. In fact we obtain a much stronger result: the only IFML s formulas admitting their classical negation to be expressed in IFML s itself are those whose truth-condition is in fact expressible in ML. (shrink)

Modal logics have in the past been used as a unifying framework for the minimality semantics used in defeasible inference, conditional logic, and belief revision. The main aim of the present paper is to add adaptive logics, a general framework for a wide range of defeasible reasoning forms developed by Diderik Batens and his co-workers, to the growing list of formalisms that can be studied with the tools and methods of contemporary modal logic. By characterising the (...) class of abnormality models, this aim is achieved at the level of the model-theory. By proposing formulae that express the consequence relation of adaptive logic in the object-language, the same aim is also partially achieved at the syntactical level. (shrink)

ABSTRACT: Part 1 discusses the Stoic notion of propositions (assertibles, axiomata): their definition; their truth-criteria; the relation between sentence and proposition; propositions that perish; propositions that change their truth-value; the temporal dependency of propositions; the temporal dependency of the Stoic notion of truth; pseudo-dates in propositions. Part 2 discusses Stoic modal logic: the Stoic definitions of their modal notions (possibility, impossibility, necessity, non-necessity); the logical relations between the modalities; modalities as properties of propositions; contingent propositions; the relation (...) between the Stoic modal notions and those of Diodorus Cronus and Philo of Megara; the role of ‘external hindrances’ for the modalities; the temporal dependency of the modalities; propositions that change their modalities; the principle that something possible can follow from something impossible; the interpretations of the Stoic modal system by B. Mates, M. Kneale, M. Frede, J. Vuillemin and M. Mignucci are evaluated. -/- For a much shorter English version of Part 1 of the book see my ‘Stoic Logic’, in K. Algra et al. (eds), The Cambridge History of Hellenistic Philosophy, Cambridge 1999, 92-157. For a shorter, updated, English version of Part 2 of the book see my 'Chrysippus' Modal Logic and its Relation to Philo and Diodorus', in K. Doering / Th. Ebert (eds) Dialektiker und Stoiker (Stuttgart 1993) 63-84. (shrink)

This paper deals with the infinitary modal propositional logic Kω1, featuring countable disjunctions and conjunc- tions. It is known that the natural infinitary extension LK.

We study several modal languages in which some (sets of) generalized quantifiers can be represented; the main language we consider is suitable for defining any first order definable quantifier, but we also consider a sublanguage thereof, as well as a language for dealing with the modal counterparts of some higher order quantifiers. These languages are studied both from a modal logic perspective and from a quantifier perspective. Thus the issues addressed include normal forms, expressive power, completeness (...) both of modal systems and of systems in the quantifier tradition, complexity as well as syntactic characterizations of special semantic constraints. Throughout the paper several techniques current in the theory of generalized quantifiers are used to obtain results in modal logic, and conversely. (shrink)

We examine the transitions between sets of possible worlds described by the compositional semantics of Modal Dependence Logic, and we use them as the basis for a dynamic version of this logic. We give a game theoretic semantics, a (compositional) transition semantics and a power game semantics for this new variant of modal Dependence Logic, and we prove their equivalence; and furthermore, we examine a few of the properties of this formalism and show that (...) class='Hi'>Modal Dependence Logic can be recovered from it by reasoning in terms of reachability. Then we show how we can generalize this approach to a very general formalism for reasoning about transformations between pointed Kripke models. (shrink)

ABSTRACT: The modal systems of the Stoic logician Chrysippus and the two Hellenistic logicians Philo and Diodorus Cronus have survived in a fragmentary state in several sources. From these it is clear that Chrysippus was acquainted with Philo’s and Diodorus’ modal notions, and also that he developed his own in contrast of Diodorus’ and in some way incorporated Philo’s. The goal of this paper is to reconstruct the three modal systems, including their modal definitions and (...) class='Hi'>modal theorems, and to make clear the exact relations between them; moreover, to elucidate the philosophical reasons that may have led Chrysippus to modify his predessors’ modal concept in the way he did. It becomes apparent that Chrysippus skillfully combined Philo’s and Diodorus’ modal notions, with making only a minimal change to Diodorus’ concept of possibility; and that he thus obtained a modal system of modalities (logical and physical) which fit perfectly fit into Stoic philosophy. (shrink)

Machine generated contents note: Introduction and overview; 1. Logics with actualist quantifiers; 2. The Barcan formulas; 3. The existence predicate; 4. Propositional functions and predicate substitution; 5. Identity; 6. Cover semantics for relevant logic; References; Index.

Modal dependence logic was introduced recently by Väänänen. It enhances the basic modal language by an operator = (). For propositional variables p 1, . . . , p n , = (p 1, . . . , p n-1, p n ) intuitively states that the value of p n is determined by those of p 1, . . . , p n-1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence (...) logic is complete for nondeterministic exponential time.In this paper we consider fragments of modal dependence logic obtained by restricting the set of allowed propositional connectives. We show that satisfiability for poor man’s dependence logic, the language consisting of formulas built from literals and dependence atoms using ${\wedge, \square, \lozenge}$ (i. e., disallowing disjunction), remains NEXPTIME-complete. If we only allow monotone formulas (without negation, but with disjunction), the complexity drops to PSPACE-completeness.We also extend Väänänen’s language by allowing classical disjunction besides dependence disjunction and show that the satisfiability problem remains NEXPTIME-complete. If we then disallow both negation and dependence disjunction, satisfiability is complete for the second level of the polynomial hierarchy. Additionally we consider the restriction of modal dependence logic where the length of each single dependence atom is bounded by a number that is fixed for the whole logic. We show that the satisfiability problem for this bounded arity dependence logic is PSPACE-complete and that the complexity drops to the third level of the polynomial hierarchy if we then disallow disjunction.In this way we completely classify the computational complexity of the satisfiability problem for all restrictions of propositional and dependence operators considered by Väänänen and Sevenster. (shrink)

It is well known that the modal logic S5 can be embedded in the classical predicate logic by interpreting the modal operator in terms of a quantifier. Wajsberg [10] proved this fact in a syntactic way. Mints [7] extended this result to the quantified version of S5; using a purely proof-theoretic method he showed that the quantified S5 corresponds to the classical predicate logic with one-sorted variable. In this paper we extend Mints' result (...) to the basic modal logic S4; we investigate the correspondence between the quantified versions of S4 (with and without the Barcan formula) and the classical predicate logic (with one-sorted variable). We present a purely proof-theoretic proof-transformation method, reducing an LK-proof of an interpreted formula to a modal proof. (shrink)

A modal logic for translating a sequence of English sentences to a sequence of logical forms is presented, characterized by Kripke models with points formed from input/output sequences, and valuations determined by entailment relations. Previous approaches based (to one degree or another) on Quantified Dynamic Logic are embeddable within it. Applications to presupposition and ambiguity are described, and decision procedures and axiomatizations supplied.

Provability logic is a modal logic for studying properties of provability predicates, and Interpretability logic for studying interpretability between logical theories. Their natural models are GL-models and Veltman models, for which the accessibility relation is well-founded. That’s why the usual counterexample showing the necessity of finite image property in Hennessy-Milner theorem (see [1]) doesn’t exist for them. However, we show that the analogous condition must still hold, by constructing two GL-models with worlds in them that are (...) modally equivalent but not bisimilar, and showing how these GL-models can be converted to Veltman models with the same properties. In the process we develop some useful constructions: games on Veltman models, chains, and general method of transformation from GL-models/frames to Veltman ones. (shrink)

En este artículo discuto el supuesto compromiso de la lógica modal cuantificada con el esencialismo. Entre otros argumentos, Quine, el más emblemático de los críticos de la modalidad, ha objetado a la lógica modal cuantificada que ésta se compromete con una doctrina filosófica usualmente considerada sospechosa, el esencialismo: la concepción que distingue, de entre los atributos de una cosa, aquellos que le son esenciales de otros poseidos sólo contingentemente. Examino en qué medida Quine puede tener razón sobre ese (...) punto explorando una analogía entre la lógica modal y la logica clásica de primer orden. Con ello se pretende proporcionar una visión clarificadora sobre el estatus de la lógica modal y su relación con la lógica en general.In this paper I discuss the alleged commitment of quantified modal logic to philosophical essentialism. Besides some other more or less related arguments against quantified modal logic, Quine (its more prominent critic) objects to it by claiming its commitment to a philosophical doctrine usually regarded as suspicious, essentialism: the view that some of the attributes of a thing are essential to it, and others are accidental. I study to what extent Quine can be right about this specific issue. I defend some of his views by exploring an analogy between modal logic and standard first order logic. That serves to get a better understanding of the status of modal logic and its relation with logic in general. (shrink)

En este artículo discuto el supuesto compromiso de la lógica modal cuantificada con el esencialismo. Entre otros argumentos, Quine, el más emblemático de los críticos de la modalidad, ha objetado a la lógica modal cuantificada que ésta se compromete con una doctrina filosófica usualmente considerada sospechosa, el esencialismo: la concepción que distingue, de entre los atributos de una cosa, aquellos que le son esenciales de otros poseidos sólo contingentemente. Examino en qué medida Quine puede tener razón sobre ese (...) punto explorando una analogía entre la lógica modal y la logica clásica de primer orden. Con ello se pretende proporcionar una visión clarificadora sobre el estatus de la lógica modal y su relación con la lógica en general.In this paper I discuss the alleged commitment of quantified modal logic to philosophical essentialism. Besides some other more or less related arguments against quantified modal logic, Quine (its more prominent critic) objects to it by claiming its commitment to a philosophical doctrine usually regarded as suspicious, essentialism: the view that some of the attributes of a thing are essential to it, and others are accidental. I study to what extent Quine can be right about this specific issue. I defend some of his views by exploring an analogy between modal logic and standard first order logic. That serves to get a better understanding of the status of modal logic and its relation with logic in general. (shrink)

In philosophical logic necessity is usually conceived as a sentential operator rather than as a predicate. An intensional sentential operator does not allow one to express quantified statements such as 'There are necessary a posteriori propositions' or 'All laws of physics are necessary' in first-order logic in a straightforward way, while they are readily formalized if necessity is formalized by a predicate. Replacing the operator conception of necessity by the predicate conception, however, causes various problems and forces (...) one to reject many philosophical accounts involving necessity that are based on the use of operator modal logic. We argue that the expressive power of the predicate account can be restored if a truth predicate is added to the language of first-order modal logic, because the predicate 'is necessary' can then be replaced by 'is necessarily true'. We prove a result showing that this substitution is technically feasible. To this end we provide partial possible-worlds semantics for the language with a predicate of necessity and perform the reduction of necessities to necessary truths. The technique applies also to many other intensional notions that have been analysed by means of modal operators. (shrink)

This is part I of a two-part essay introducing case-intensional first order logic (CIFOL), an easy-to-use, uniform, powerful, and useful combination of first-order logic with modal logic resulting from philosophical and technical modifications of Bressan’s General interpreted modal calculus (Yale University Press 1972 ). CIFOL starts with a set of cases; each expression has an extension in each case and an intension, which is the function from the cases to the respective case-relative extensions. Predication is (...) intensional; identity is extensional. Definite descriptions are context-independent terms, and lambda-predicates and -operators can be introduced without constraints. These logical resources allow one to define, within CIFOL, important properties of properties, viz., extensionality (whether the property applies, depends only on an extension in one case) and absoluteness, Bressan’s chief innovation that allows tracing an individual across cases without recourse to any notion of “rigid designation” or “trans-world identity.” Thereby CIFOL abstains from incorporating any metaphysical principles into the quantificational machinery, unlike extant frameworks of quantified modal logic. We claim that this neutrality makes CIFOL a useful tool for discussing both metaphysical and scientific arguments involving modality and quantification, and we illustrate by discussing in diagrammatic detail a number of such arguments involving the extensional identification of individuals via absolute (substance) properties, essential properties, de re vs. de dicto , and the results of possible tests. (shrink)

This landmark work provides a systematic introduction to systems of modal logic and stands as the first presentation of what have become central ideas in philosophy of language and metaphysics, from the "new theory of reference" and non-linguistic necessity and essentialism to "Kripke semantics.".

This long-awaited book replaces not one but both of Hughes and Cresswell's two previous classic studies of modal logic: An Introduction to Modal Logic and A Companion to Modal Logic . A New Introduction to Modal Logic has been completely rewritten by the authors to incorporate all the developments that have taken place since 1968 both in modal propositional logical and modal predicate logic, but without sacrificing the clarity of (...) exposition and approachability that were essential features of the earlier works. The book takes readers through the most basic systems of modal prepositional logic right up to systems of modal predicate with identity. It deals with both technical developments such as completeness and incompleteness, and finite and infinite models, and discusses philosophical applications, especially, in the area of modal predicate logic. (shrink)

The Handbook of Modal Logic contains 20 articles, which collectively introduce contemporary modal logic, survey current research, and indicate the way in which the field is developing. The articles survey the field from a wide variety of perspectives: the underling theory is explored in depth, modern computational approaches are treated, and six major applications areas of modal logic (in Mathematics, Computer Science, Artificial Intelligence, Linguistics, Game Theory, and Philosophy) are surveyed. The book contains both (...) well-written expository articles, suitable for beginners approaching the subject for the first time, and advanced articles, which will help those already familiar with the field to deepen their expertise. Please visit: http://people.uleth.ca/~woods/RedSeriesPromo_WP/PubSLPR.html - Compact modal logic reference - Computational approaches fully discussed - Contemporary applications of modal logic covered in depth. (shrink)

A textbook on modal logic, intended for readers already acquainted with the elements of formal logic, containing nearly 500 exercises. Brian F. Chellas provides a systematic introduction to the principal ideas and results in contemporary treatments of modality, including theorems on completeness and decidability. Illustrative chapters focus on deontic logic and conditionality. Modality is a rapidly expanding branch of logic, and familiarity with the subject is now regarded as a necessary part of every philosopher's technical (...) equipment. Chellas here offers an up-to-date and reliable guide essential for the student. (shrink)

Aristotle's Modal Logic presents a very new interpretation of Aristotle's logic by arguing that a proper understanding of the system depends on an appreciation of its connection to the metaphysics. Richard Patterson develops three striking theses in the book. First, there is a fundamental connection between Aristotle's logic of possibility and necessity, and his metaphysics, and that this connection extends far beyond the widely recognised tie to scientific demonstration and relates to the more basic distinction between (...) the essential and accidental properties of a subject. Second, Aristotle's views on modal logic depend in very significant ways on his metaphysics without entailing any sacrifice in rigour. Third, once one has grasped the nature of the relationship, one can understand better certain genuine difficulties in the system of logic and appreciate its strengths in terms of the purposes for which it was created. (shrink)

This modern, advanced textbook reviews modal logic, a field which caught the attention of computer scientists in the late 1970's.

Proof Theory of Modal Logic is devoted to a thorough study of proof systems for modal logics, that is, logics of necessity, possibility, knowledge, belief, time, computations etc. It contains many new technical results and presentations of novel proof procedures. The volume is of immense importance for the interdisciplinary fields of logic, knowledge representation, and automated deduction.

For a novice this book is a mathematically-oriented introduction to modal logic, the discipline within mathematical logic studying mathematical models of reasoning which involve various kinds of modal operators. It starts with very fundamental concepts and gradually proceeds to the front line of current research, introducing in full details the modern semantic and algebraic apparatus and covering practically all classical results in the field. It contains both numerous exercises and open problems, and presupposes only minimal knowledge (...) in mathematics. A specialist can use the book as a source of references. Results and methods of many directions in propositional modal logic, from completeness and duality to algorithmic problems, are collected and systematically presented in one volume. (shrink)

This is a first course in propositional modal logic, suitable for mathematicians, computer scientists and philosophers. Emphasis is placed on semantic aspects, in the form of labelled transition structures, rather than on proof theory. The book covers all the basic material - propositional languages, semantics and correspondence results, proof systems and completeness results - as well as some topics not usually covered in a modal logic course. It is written from a mathematical standpoint. To help the (...) reader, the material is covered in short chapters, each concentrating on one topic. These are arranged into five parts, each with a common theme. An important feature of the book is the many exercises and an extensive set of solutions is provided. (shrink)

The Unprovability of Consistency is concerned with connections between two branches of logic: proof theory and modal logic. Modal logic is the study of the principles that govern the concepts of necessity and possibility; proof theory is, in part, the study of those that govern provability and consistency. In this book, George Boolos looks at the principles of provability from the standpoint of modal logic. In doing so, he provides two perspectives on a (...) debate in modal logic that has persisted for at least thirty years between the followers of C. I. Lewis and W. V. O. Quine. The author employs semantic methods developed by Saul Kripke in his analysis of modal logical systems. The book will be of interest to advanced undergraduate and graduate students in logic, mathematics and philosophy, as well as to specialists in those fields. (shrink)

This book treats modal logic as a theory, with several subtheories, such as completeness theory, correspondence theory, duality theory and transfer theory and is intended as a course in modal logic for students who have had prior contact with modal logic and who wish to study it more deeply. It presupposes training in mathematical or logic. Very little specific knowledge is presupposed, most results which are needed are proved in this book.

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)

This paper attacks the modal ontological argument, as advocated by Plantinga among others. Whereas other criticisms in the literature reject one of its premises, the present line is that the argument is invalid. This becomes apparent once we run the argument assuming fictionalism about possible worlds. Broadly speaking, the problem is that if one defines “x” as something that exists, it does not follow that there is anything satisfying the definition. Yet unlike non-modal ontological arguments, the modal (...) argument commits this “existential fallacy” not in relation to the definition of ‘God’. Rather, it occurs in relation to the modal facts quantified over within a Kripkean modal logic. In brief, we can describe the modal facts by whichever logic we prefer—yet it does not follow that there are genuine modal facts, as opposed to mere facts-according-to-the-fiction. A broader consequence of the discussion is that the existential fallacy is an issue for many projects in “armchair metaphysics.”. (shrink)

ABSTRACT: A detailed presentation of Stoic logic, part one, including their theories of propositions (or assertibles, Greek: axiomata), demonstratives, temporal truth, simple propositions, non-simple propositions(conjunction, disjunction, conditional), quantified propositions, logical truths, modal logic, and general theory of arguments (including definition, validity, soundness, classification of invalid arguments).

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)

In this paper we study proof procedures for some variants of first-order modal logics, where domains may be either cumulative or freely varying and terms may be either rigid or non-rigid, local or non-local. We define both ground and free variable tableau methods, parametric with respect to the variants of the considered logics. The treatment of each variant is equally simple and is based on the annotation of functional symbols by natural numbers, conveying some semantical information on the worlds (...) where they are meant to be interpreted.This paper is an extended version of a previous work where full proofs were not included. Proofs are in some points rather tricky and may help in understanding the reasons for some details in basic definitions. (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)

In this text, a variety of modal logics at the sentential, first-order, and second-order levels are developed with clarity, precision and philosophical insight.

There are several known Lindström-style characterization results for basic modal logic. This paper proves a generic Lindström theorem that covers any normal modal logic corresponding to a class of Kripke frames definable by a set of formulas called strict universal Horn formulas. The result is a generalization of a recent characterization of modal logic with the global modality. A negative result is also proved in an appendix showing that the result cannot be strengthened to (...) cover every first-order elementary class of frames. This is shown by constructing an explicit counterexample. (shrink)

Extensively classroom-tested, Possibilities and Paradox provides an accessible and carefully structured introduction to modal and many-valued logic. The authors cover the basic formal frameworks, enlivening the discussion of these different systems of logic by considering their philosophical motivations and implications. Easily accessible to students with no background in the subject, the text features innovative learning aids in each chapter, including exercises that provide hands-on experience, examples that demonstrate the application of concepts, and guides to further reading.

In this paper we introduce non-normal modal extensions of the sub-classical logics CLoN, CluN and CLaN, in the same way that S0.5 0 extends classical logic. The first modal system is both paraconsistent and paracomplete, while the second one is paraconsistent and the third is paracomplete. Despite being non-normal, these systems are sound and complete for a suitable Kripke semantics. We also show that these systems are appropriate for interpreting □ as “is provable in classical logic”. (...) This allows us to recover the theorems of propositional classical logic within three sub-classical modal systems. (shrink)

To understand the thesis of actualism, consider the following example. Imagine a race of beings — call them ‘Aliens’ — that is very different from any life-form that exists anywhere in the universe; different enough, in fact, that no actually existing thing could have been an Alien, any more than a given gorilla could have been a fruitfly. Now, even though there are no Aliens, it seems intuitively the case that there could have been such things. After all, life might (...) have evolved very differently than the way it did in fact. So in virtue of what is it true that there could have been Aliens when in fact there are none, and when, moreover, nothing that exists in fact could have been an Alien? So-called "possibilists" offer the following answer: ‘It is possible that there are Aliens’ is true because there are in fact individuals that could have been Aliens. At first blush, this might appear directly to contradict the premise that no existing thing could possibly have been an Alien. The possibilist's thesis, however, is that existence, or actuality, encompasses only a subset of the things that, in the broadest sense, are. So for the possibilist, ‘It is possible that there are Aliens’ is true simply in virtue of the fact that there are possible-but-nonactual Aliens, i.e., things that could have existed (but do not) and which would have been Aliens if they had. Actualists reject this answer; they deny that there are any nonactual individuals. Thus, actualism is the philosophical position that everything there is — everything that can in any sense be said to be — exists, or is actual. (shrink)

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)

The well known AGM framework for belief revision has recently been extended to include a model of the research agenda of the agent, i.e. a set of questions to which the agent wishes to find answers (Olsson & Westlund in Erkenntnis , 65 , 165–183, 2006 ). The resulting model has later come to be called interrogative belief revision . While belief revision has been studied extensively from the point of view of modal logic, so far interrogative belief (...) revision has only been dealt with in the metalanguage approach in which AGM was originally presented. In this paper, I show how to model interrogative belief revision in a modal object language using a class of operators for questions. In particular, the solution I propose will be shown to capture the notion of K-truncation , a method for agenda update in the case of expansion constructed by Olsson & Westlund. Two case studies are conducted: first, an interrogative extension of Krister Segerberg’s system DDL, and then a similar extension of Giacomo Bonanno’s modal logic for belief revision. Sound and complete axioms will be provided for both of the resulting logics. (shrink)

The modal logic of Gödel sentences, termed as GS , is introduced to analyze the logical properties of ‘true but unprovable’ sentences in formal arithmetic. The logic GS is, in a sense, dual to Grzegorczyk’s Logic, where modality can be interpreted as ‘true and provable’. As we show, GS and Grzegorczyk’s Logic are, in fact, mutually embeddable. We prove Kripke completeness and arithmetical completeness for GS . GS is also an extended system of the (...) class='Hi'>logic of ‘Essence and Accident’ proposed by Marcos (Bull Sect Log 34(1):43–56, 2005 ). We also clarify the relationships between GS and the provability logic GL and between GS and Intuitionistic Propositional Logic. (shrink)

In the paper (Braüner, 2001) we gave a minimal condition for the existence of a homophonic theory of truth for a modal or tense logic. In the present paper we generalise this result to arbitrary modal logics and we also show that a modal logic permits the existence of a homophonic theory of truth if and only if it permits the definition of a so-called master modality. Moreover, we explore a connection between the master modality (...) and hybrid logic: We show that if attention is restricted to bidirectional frames, then the expressive power of the master modality is exactly what is needed to translate the bounded fragment of first-order logic into hybrid logic in a truth preserving way. We believe that this throws new light on Arthur Prior's fourth grade tense logic. (shrink)

We show that if we interpret modal diamond as the derived set operator of a topological space, then the modal logic of Stone spaces is K4 and the modal logic of weakly scattered Stone spaces is K4G. As a corollary, we obtain that K4 is also the modal logic of compact Hausdorff spaces and K4G is the modal logic of weakly scattered compact Hausdorff spaces.

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

This paper deals with modality in Peirce's existential graphs, as expressed in his gamma and tinctured systems. We aim at showing that there were two philosophically motivated decisions of Peirce's that, in the end, hindered him from producing a modern, conclusive system of modal logic. Finally, we propose emendations and modifications to Peirce's modal graphical tinctured systems and to their underlying ideas that will produce modern modal systems.

A propositional system of modal logic is second-order if it contains quantifiers ∀p and ∃p, which, in the standard interpretation, are construed as ranging over sets of possible worlds (propositions). Most second-order systems of modal logic are highly intractable; for instance, when augmented with propositional quantifiers, K, B, T, K4 and S4 all become effectively equivalent to full second-order logic. An exception is S5, which, being interpretable in monadic second-order logic, is decidable.

In this article, the author studies some central concepts in Avicenna's and sī's modal logics as presented in Avicenna's Al-Ish r t wa'l Tan īh t ( Pointers and Reminders ) and in sī's commentary. In this work, Avicenna introduces some remarkable distinctions in order to interpret Aristotle's modal syllogistic in the Prior Analytics . The author outlines a new interpretation of absolute sentences as temporally indefinite sentences and argues on the basis of this that Avicenna seems to (...) subscribe to the Principle of Plenitude. He also shows that he has no valid proof of the modal conversion rules and that he uses some rather ad hoc distinctions to show that Aristotle's modal syllogistic is correct. The author also notes some interesting differences between Avicenna's and sī's approaches to modal logic. (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)

The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. (...) In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are. (shrink)

I develop a probabilistic semantics for modal logic that generalizes the quantificational apparatus of Kripke models. Soundness and completeness theorems are proved for propositional M, B, S4, and S5. My semantics formalizes the idea that uncertainty about modal claims like "Possibly-A" arises from the fact that thought experiments which test the intelligibility of A may be inconclusive for a given agent. On this view, an agent who is uncertain about "Possibly-A" assigns at least as much credibility to (...) "Possibly-A" as s/he assigns to A in any of the inconclusive thought experiments, but not more. (shrink)

This paper propounds a systematic examination of the link between the Knower Paradox and provability interpretations of modal logic. The aim of the paper is threefold: to give a streamlined presentation of the Knower Paradox and related results; to clarify the notion of a syntactical treatment of modalities; finally, to discuss the kind of solution that modal provability logic provides to the Paradox. I discuss the respective strength of different versions of the Knower Paradox, both in (...) the framework of first-order arithmetic and in that of modal logic with fixed point operators. It is shown that the notion of a syntactical treatment of modalities is ambiguous between a self-referential treatment and a metalinguistic treatment of modalities, and that these two notions are independent. I survey and compare the provability interpretations of modality respectively given by Skyrms, B. (1978, The Journal of Philosophy 75: 368–387) Anderson, C.A. (1983, The Journal of Philosophy 80: 338–355) and Solovay, R. (1976, Israel Journal of Mathematics 25: 287–304). I examine how these interpretations enable us to bypass the limitations imposed by the Knower Paradox while preserving the laws of classical logic, each time by appeal to a distinct form of hierarchy. (shrink)

The hybrid logic and the independence friendly modal logic IFML are compared for their expressive powers. We introduce a logic IFML c having a non-standard syntax and a compositional semantics; in terms of this logic a syntactic fragment of IFML is singled out, denoted IFML c . (In the Appendix it is shown that the game-theoretic semantics of IFML c coincides with the compositional semantics of IFML c .) The hybrid logic is proven to (...) be strictly more expressive than IFML c . By contrast, and the full IFML are shown to be incomparable for their expressive powers. Building on earlier research (Tulenheimo and Sevenster 2006), a PSPACE -decidable fragment of the undecidable logic is disclosed. This fragment is not translatable into the hybrid logic and has not been studied previously in connection with hybrid logics. In the Appendix IFML c is shown to lack the property of ‘quasi-positionality’ but proven to enjoy the weaker property of ‘ bounded quasi-positionality’. The latter fact provides from the IFML internal perspective an account of what makes the compositional semantics of IFML c possible. (shrink)

The quantified relevant logic RQ is given a new semantics in which a formula ∀xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of 'extensional confinement': ∀x(A V B) → (...) (A V ∀xB), with x not free in A. Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation. (shrink)

This paper presents a new modal logic for ceteris paribus preferences understood in the sense of "all other things being equal". This reading goes back to the seminal work of Von Wright in the early 1960's and has returned in computer science in the 1990' s and in more abstract "dependency logics" today. We show how it differs from ceteris paribus as "all other things being normal", which is used in contexts with preference defeaters. We provide a semantic (...) analysis and several completeness theorems. We show how our system links up with Von Wright's work, and how it applies to game-theoretic solution concepts, to agenda setting in investigation, and to preference change. We finally consider its relation with infinitary modal logics. (shrink)

This paper establishes a connection between structure sensitive categorial inference and classical modal logic. The embedding theorems for non-associative Lambek Calculus and the whole class of its weak Sahlqvist extensions demonstrate that various resource sensitive regimes can be modelled within the framework of unimodal temporal logic. On the semantic side, this requires decomposition of the ternary accessibility relation to provide its correlation with standard binary Kripke frames and models.

H. B. Smith, Professor of Philosophy at the influential Pennsylvania School was (roughly) a contemporary of C. I. Lewis who was similarly interested in a proper account of implication. His research also led him into the study of modal logic but in a different direction than Lewis was led. His account of modal logic does not lend itself as readily as Lewis' to the received possible worlds semantics, so that the Smith approach was a (...) casualty rather than a beneficiary of the renewed interest in modality. In this essay we present some of the main points of the Smith approach, in a new guise. (shrink)

In many logics dealing with information one needs to make statements not only about cognitive states, but also about transitions between them. In this paper we analyze a dynamic modal logic that has been designed with this purpose in mind. On top of an abstract information ordering on states it has instructions to move forward or backward along this ordering, to states where a certain assertion holds or fails, while it also allows combinations of such instructions by means (...) of operations from relation algebra. In addition, the logic has devices for expressing whether in a given state a certain instruction can be carried out, and whether that state can be arrived at by carrying out a certain instruction.This paper deals mainly with technical aspects of our dynamic modal logic. It gives an exact description of the expressive power of this language; it also contains results on decidability for the language with arbitrary structures and for the special case with a restricted class of admissible structures. In addition, a complete axiomatization is given. The paper concludes with a remark about the modal algebras appropriate for our dynamic modal logic, and some questions for further work. (shrink)