Modal logic is the logic of necessity and possibility, of ‘must be’ and ‘may be’. These may be interpreted in various ways. If necessity is necessary truth, there is alethic modal logic; if it is moral or normative necessity, there is deontic logic [see chapter 8]. It may refer to what is known or believed to be true, in which case, there is an epistemic logic [chapter 9], or to what always has been (...) or to what henceforth always will be true, which gives an aspect of temporal logic [chapter 10]. Another interpretation is to read ‘Necessarily p′ as ‘it is provable that p′ This chapter will present the general framework of modal logic applicable to all of these, though with emphasis on alethic modal logics. (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)

Kripke-style models with two accessibility relations, one intuitionistic and the other modal, are given for analogues of the modal systemK based on Heyting's prepositional logic. It is shown that these two relations can combine with each other in various ways. Soundness and completeness are proved for systems with only the necessity operator, or only the possibility operator, or both. Embeddings in modal systems with several modal operators, based on classical propositional logic, are also (...) considered. This paper lays the ground for an investigation of intuitionistic analogues of systems stronger thanK. A brief survey is given of the existing literature on intuitionistic modal logic. (shrink)

A logical systemBM + is proposed, which, is a prepositional calculus enlarged with prepositional quantifiers and with two modal signs, and These modalities are submitted to a finite number of axioms. is the usual sign of necessity, corresponds to transmutation of a property (to be white) into the abstract property (to be the whiteness). An imbedding of the usual theory of classesM intoBM + is constructed, such that a formulaA is provable inM if and only if(A) is (...) provable inBM +. There is also an inverse imbedding with an analogous property. (shrink)

This paper, a sequel to Models for normal intuitionistic modal logics by M. Boi and the author, which dealt with intuitionistic analogues of the modal system K, deals similarly with intuitionistic analogues of systems stronger than K, and, in particular, analogues of S4 and S5. For these prepositional logics Kripke-style models with two accessibility relations, one intuitionistic and the other modal, are given, and soundness and completeness are proved with respect to these models. It is shown (...) how the holding of formulae characteristic for particular logics is equivalent to conditions for the relations of the models. Modalities in these logics are also investigated. (shrink)

The main results of the paper are the following: For each monadic prepositional formula which is classically true but not intuitionistically so, there is a continuum of intuitionistic monotone modal logics L such that L+ is inconsistent.There exists a consistent intuitionistic monotone modal logic L such that for any formula of the kind mentioned above the logic L+ is inconsistent.

We give sound and complete tableau and sequent calculi for the prepositional normal modal logics S4.04, K4B and G 0(these logics are the smallest normal modal logics containing K and the schemata A A, A A and A ( A); A A and AA; A A and ((A A) A) A resp.) with the following properties: the calculi for S4.04 and G 0are cut-free and have the interpolation property, the calculus for K4B contains a restricted version of (...) the cut-rule, the so-called analytical cut-rule.In addition we show that G 0is not compact (and therefore not canonical), and we proof with the tableau-method that G 0is characterised by the class of all finite, (transitive) trees of degenerate or simple clusters of worlds; therefore G 0is decidable and also characterised by the class of all frames for G 0. (shrink)

The possible-worlds semantics for modality says that a sentence is possibly true if it is true in some possible world. Given classical prepositional logic, one can easily prove that every consistent set of propositions can be embedded in a ‘maximal consistent set’, which in a sense represents a possible world. However the construction depends on the fact that standard modal logics are finitary, and it seems false that an infinite collection of sets of sentences each finite subset (...) of which is intuitively ‘possible’ in natural language has the property that the whole set is possible. The argument of the paper is that the principles needed to shew that natural language possibility sentences involve quantification over worlds are analogous to those used in infinitary modal logic. (shrink)

There exist important deductive systems, such as the non-normal modal logics, that are not proper subjects of classical algebraic logic in the sense that their metatheory cannot be reduced to the equational metatheory of any particular class of algebras. Nevertheless, most of these systems are amenable to the methods of universal algebra when applied to the matrix models of the system. In the present paper we consider a wide class of deductive systems of this kind called protoalgebraic logics. (...) These include almost all (non-pathological) systems of prepositional logic that have occurred in the literature. The relationship between the metatheory of a protoalgebraic logic and its matrix models is studied. The following results are obtained for any finite matrix model U of a filter-distributive protoalgebraic logic : (I) The extension U of is finitely axiomatized (provided has only finitely many inference rules); (II) U has only finitely many extensions. (shrink)

This book shows that the semantic analysis of modal notions of possibility and necessity can be used to enhance our understanding of the interpretation of reports of belief or emotional state. It introduces intuitive notation and terminology to express ideas in modern theories of modal interpretation that are normally represented in complex logical formulas, effectively updates the 1960s-era link between possible worlds and the semantics of propositional attitude ascriptions, and reconciles two disparate views of the role of events (...) in semantic interpretation, that of Donald Davidson and that of David Lewis. It reduces a host of variable behaviors of propositional attitude ascription to an intuitive and precise distinction between ascriptions that merely express a commitment to propositional content versus ones that attribute a mental state to the holder of the propositional attitude. This leads to an explanation of the nature and effects of the language disorder of fluent aphasia. (shrink)

Metaphysics and language: Quine, W. V. O. On the individuation of attributes. Körner, S. On some relations between logic and metaphysics. Marcus, R. B. Does the principle of substitutivity rest on a mistake? Van Fraassen, B. C. Platonism's pyrrhic victory. Martin, R. M. On some prepositional relations. Kearns, J. T. Sentences and propositions.--Basic and combinatorial logic: Orgass, R. J. Extended basic logic and ordinal numbers. Curry, H. B. Representation of Markov algorithms by combinators.--Implication and consistency: Anderson, (...) A. R. Fitch on consistency. Belnap, N. D., Jr. Grammatical propaedeutic. Thomason, R. H. Decidability in the logic of conditionals. Myhill, J. Levels of implication.--Deontic, epistemic, and erotetic logic: Bacon, J. Belief as relative knowledge. Wu, K. J. Believing and disbelieving. Kordig, C. R. Relativized deontic modalities. Harrah, D. A system for erotetic sentences. (shrink)

This paper is a survey of results concerning the disjunction property, Halldén-completeness, and other related properties of intermediate prepositional logics and normal modal logics containing S4.

We show that the modal prepositional logicILM (interpretability logic with Montagna's principle), which has been shown sound and complete as the interpretability logic of Peano arithmetic PA (by Berarducci and Savrukov), is sound and complete as the logic ofπ 1-conservativity over eachbE 1-sound axiomatized theory containingI⌆ 1 (PA with induction restricted tobE 1-formulas). Furthermore, we extend this result to a systemILMR obtained fromILM by adding witness comparisons in the style of Guaspari's and Solovay's logicR (this (...) will be done in a separate continuation of the present paper). (shrink)

I consider the idea of a propositional logic of location based on the following semantic framework, derived from ideas of Prior. We have a collection L of locations and a collection S of statements such that a statement may be evaluated for truth at each location. Typically one and the same statement may be true at one location and false at another. Given this semantic framework we may proceed in two ways: introducing names for locations, predicates for the relations (...) among them and an “at” preposition to express the value of statements at locations; or introduce statement operators which do not name locations but whose truth-conditional effect depends on the truth or falsity of embedded statements at various locations. The latter is akin to Prior’s approach to tense logic. In any logic of location there will be some basic operators which we can define. By ringing the changes on the topology of locations, different logical systems may be generated, and the challenge for the logician is then in each case to find operators, axioms and rules yielding a proof theory adequate to the semantics. The generality of the approach is illustrated with familiar and not so familiar examples from modal, tense and place logic, mathematics, and even the logic of games. To the memory of Ted Dawson, who introduced me to philosophy and the writings of Arthur Prior. (shrink)

Timothy Williamson gives an original and provocative treatment of deep metaphysical questions about existence, contingency, and change, using the latest resources of quantified modal logic. Contrary to the widespread assumption that logic and metaphysics are disjoint, he argues that modal logic provides a structural core for metaphysics.

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 book is valuable as expounding in full a theory of meaning that has its roots in the work of Frege and has been of the widest influence.

Predicate modal formulas are considered as schemata of arithmetical formulas, where is interpreted as the standard formula of provability in a fixed sufficiently rich theory T in the language of arithmetic. QL T(T) and QL T are the sets of schemata of T-provable and true formulas, correspondingly. Solovay's well-known result — construction an arithmetical counterinterpretation by Kripke countermodel — is generalized on the predicate modal language; axiomatizations of the restrictions of QL T(T) and QL T by formulas, which (...) contain no variables different from x, are given by means of decidable prepositional bimodal systems; under the assumption that T is 1-complete, there is established the enumerability of the restrictions of QL T(T) and QL T by: 1) formulas in which the domains of different occurrences of don't intersect and 2) formulas of the form n A. (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)

The first amounts, roughly, to "It is necessarily the case that any President of the U.S. is a citizen of the U.S." But the second says, "the person who in fact is the President of the U.S, has the property of necessarily being a citizen of the U.S," Thus, while (2) is clearly true, it would be reasonable to consider (3) false.

Given a normal (multi-)modal logic a characterization is given of the finitely presentable algebras A whose logics L A split the lattice of normal extensions of . This is a substantial generalization of Rautenberg [10] and [11] in which is assumed to be weakly transitive and A to be finite. We also obtain as a direct consequence a result by Blok [2] that for all cycle-free and finite A L A splits the lattice of normal extensions of K. (...) Although we firmly believe it to be true, we have not been able to prove that if a logic splits the lattice of extensions of then is the logic of an algebra finitely presentable over ; in this respect our result remains partial. (shrink)

ABSTRACT Analytic philosophy in the mid-twentieth century underwent a major change of direction when a prior consensus in favour of extensionalism and descriptivism made way for approaches using direct reference, the necessity of identity, and modal logic. All three were first defended, in the analytic tradition, by one woman, Ruth Barcan Marcus. But analytic philosophers now tend to credit them to Kripke, or Kripke and Carnap. I argue that seeing Barcan Marcus in her historical context – one dominated (...) by extensionalism and descriptivism – allows us to see how revolutionary she was, in her work and influence on others. I focus on her debate with Quine, who found himself retreating to softened, and more viable, versions of his anti-modal arguments as a result. I make the case that Barcan's formal logic was philosophically well-motivated, connected to her views on reference, and well-matched to her overall views on ontology. Her nominalism led her to reject posits which could not be directly observed and named, such as possibilia. She conceived of modal calculi as facilitating counterfactual discourse about actual existents. I conclude that her contributions ought to be recognized as the first of their kind. Barcan Marcus must be awarded a central place in the canon of analytic philosophy. (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)

The tetravalent modal logic is one of the two logics defined by Font and Rius :481–518, 2000) in connection with Monteiro’s tetravalent modal algebras. These logics are expansions of the well-known Belnap–Dunn’s four-valued logic that combine a many-valued character with a modal character. In fact, $${\mathcal {TML}}$$ TML is the logic that preserves degrees of truth with respect to tetravalent modal algebras. As Font and Rius observed, the connection between the logic $${\mathcal (...) {TML}}$$ TML and the algebras is not so good as in $${{\mathcal {TML}}}^N$$ TML N, but, as a compensation, it has a better proof-theoretic behavior, since it has a strongly adequate Gentzen calculus :481–518, 2000). In this work, we prove that the sequent calculus given by Font and Rius does not enjoy the cut-elimination property. Then, using a general method proposed by Avron et al., we provide a sequent calculus for $${\mathcal {TML}}$$ TML with the cut-elimination property. Finally, inspired by the latter, we present a natural deduction system, sound and complete with respect to the tetravalent modal logic. (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)

Following a proposal by Kooi and Tamminga, we introduce a conservative translation manual for every four-valued truth-functional propositional logic into a modal logic. However, the application of this translation does not preserve the intuitive reading of the truth-values for every four-valued logic. In order to solve this problem, we modify the translation manual and prove its conservativity by exploiting the method of generalized truth-values.

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.