Modal logic is one of the most widely applied logical formalisms. Systems of modal logic are being used in many disciplines, ranging from artificial intelligence, computer science, mathematics, formal grammar and semantics to philosophy. This volume presents substantial recent advances in the relational and the algorithmic treatment of modal logics. It contains papers from the fifth conference on "Advances in Modal logic," held in Manchester (UK) in September 2004. Written by leading experts in the (...) field, the present book is indispensable for any advanced student and researcher in pure and applied modal logic. (shrink)

This thesis is a study on the nature of modality in Hegel’s Logic and contemporary modal metaphysics. The thesis has two aims: Firstly, it examines Lewisian modal realism, as well as the post-Lewisian modal metaphysical accounts of modal actualism and modal essentialism in order to reveal that each position appeals to a non-modal foundation to make modal concepts explicit. Each position thus falls under what Hegel regards as pre-critical metaphysics by suggesting a modally (...) unaccountable ground for modal concepts. The very idea of a foundation to modality is problematic because as a foundation, it is necessarily assumed without further justification, and it directs our attention away from the nature of modality itself to its supposed foundations. These non-modal foundational take the form of possible worlds for modal realism, the form of properties for modal actualism and the form of essence for modal essentialism. To eschew foundationalism in modal metaphysics and provide a less questionable basis for modality, the thesis suggests Hegel’s treatment of modality as a viable alternative in virtue of its being free from the concerns stemming from the pre-critical way of doing metaphysics. The thesis situates Hegel in contemporary modal metaphysics by undertaking two types of exposition. By examining Hegel's treatment of essence and property, the thesis will show negatively that essence and property cannot be a foundation for modality, while by examining Hegel’s treatment of modality, the thesis positively proves that modal concepts are analysable and explainable within the domain of actuality, a domain that can only be made explicit by modal determinations. These two expositions provide an idea of a self-sustaining and self-explanatory modal metaphysics without appealing to non-modal foundationalist metaphysical commitments. More precisely, I argue that Hegel’s logical derivation of modal concepts constitutes a Hegelian modal metaphysics, which contains a comprehensive account of modal concepts that does not rely on any non-modal primitive. (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)

Although conceived as a textbook, this extraordinary work contains a great deal of material which is either completely new or which has not appeared before in book form. It is intended as an upperlevel text for those with some familiarity with the subject already. After the introduction, there is a long chapter on formal systems which contains new material on algorithms and the theory of definition; epitheory of formal systems is then discussed, followed by an elegant algebraic treatment of logic. (...) Curry then formulates systems for negation and implication in the next two chapters, follows them by quantification theory, and ends with a sketch of modal logic. What distinguishes this from other logic texts which try to cover about the same ground is this: Curry exercises virtually exquisite care in his analysis of some of the more difficult points, variables and substitution, for example, that others often tend to gloss over. Each chapter has a section dealing with supplementary but related topics so as to give the reader some idea where the subject goes. There is an enormous bibliography and hundreds of references, including historical ones; these also increase its scholarly value. The author takes an informal semantical viewpoint about logic—trying to treat meaning as well as form as essential to logic. This view and a pellucid style make things move freely in the most difficult spots; only Curry's occasionally peculiar terminology might be confusing.—P. J. M. (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)

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)

The question of which is the logic that underlies quantum physics does not have an absolute answer, but only in relation to a conventional choice of interpretation . Most of the interpretations that have been offered work within the framework of classical logic. In contrast to these, we examine the corpuscular interpretation which is assumed in the application of non-distributive logic . The experiment in which single photons pass through a Mach-Zehnder interferometer is examined, indicating the difficulty of employing a (...) realist corpuscular interpretation in this context. One way to save this interpretation would be to use non-distributive logic to analyze the experiment, but this is not satisfactory . However, the use of an alethic modal logic solves the problem, blocking the argument that put the aforementioned corpuscular interpretation into difficulty. In the discussion of the conceptual problems involved, we suggest that a stochastic corpuscular interpretation is well adapted to this logical description. The project of extending this modal logical approach to other experiments in quantum physics, and of providing a rigorous logical treatment, is left open. (shrink)

In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several (...) extensions of \SQEMA\ where that syntactic condition is replaced by a semantic one, viz. downward monotonicity. For the first, and most general, extension \SSQEMA\ we prove correctness for a large class of modal formulae containing an extension of the Sahlqvist formulae, defined by replacing polarity with monotonicity. By employing a special modal version of Lyndon's monotonicity theorem and imposing additional requirements on the Ackermann rule we obtain restricted versions of \SSQEMA\ which guarantee canonicity, too. (shrink)

The previously introduced algorithm \sqema\ computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend \sqema\ with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents of modal formulae in the extension of first-order logic with monadic least fixed-points \mffo. This computation operates by transforming input formulae into locally frame equivalent ones in the pure fragment of the hybrid mu-calculus. In particular, we (...) prove that the recursive extension of \sqema\ succeeds on the class of `recursive formulae'. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds. (shrink)

Science is the basis for managing the affairs of life and human activities, and living without knowledge is a form of wandering and a kind of loss. Using scientific methods helps us understand the foundations of choice, decision-making, and adopting the right solutions when solutions abound and options are numerous. Operational research is considered the best that scientific development has provided because its methods depend on the application of scientific methods in solving complex issues and the optimal use of available (...) resources in various fields, private and governmental work in peace and war, in politics and economics, in planning and implementation, and in various aspects of life. Its basic essence is to use the data provided for the issue under study to build a mathematical model that is the optimal solution. It is the basis on which decision makers rely in managing institutions and companies, and when operations research methods meet with the neutrosophic teacher, we get ideal solutions that take into account all the circumstances and fluctuations that may occur in the work environment over time. One of the most important operations research methods is the linear programming method. Which prompted us to reformulate the linear models, the graphical method, and the simplex method, which are used to obtain the optimal solution for linear models using the concepts of neutrosophic science. In this research, and as a continuation of what we presented previously, we will reformulate the modified simplex algorithm that was presented to address the difficulty that we were facing when applying the direct simplex algorithm. It is the large number of calculations required to be performed in each step of the solution, which requires a lot of time and effort. (shrink)

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)

Much work has been done on specific instances of residuated lattices with modal operators . In this paper, we develop a general framework that subsumes three important classes of modal residuated lattices: interior algebras, Abelian ℓ-groups with conuclei, and negative cones of ℓ-groups with nuclei. We then use this framework to obtain results about these three cases simultaneously. In particular, we show that a categorical equivalence exists in each of these cases. The approach used here emphasizes the role (...) played by reducts in the proofs of these categorical equivalences. Lastly, we develop a connection between translations of logics and images of modal operators. (shrink)

Intuitionistic logic provides an elegant solution to the Sorites Paradox. Its acceptance has been hampered by two factors. First, the lack of an accepted semantics for languages containing vague terms has led even philosophers sympathetic to intuitionism to complain that no explanation has been given of why intuitionistic logic is the correct logic for such languages. Second, switching from classical to intuitionistic logic, while it may help with the Sorites, does not appear to offer any advantages when dealing with the (...) so-called paradoxes of higher-order vagueness. We offer a proposal that makes strides on both issues. We argue that the intuitionist’s characteristic rejection of any third alethic value alongside true and false is best elaborated by taking the normal modal system S4M to be the sentential logic of the operator ‘it is clearly the case that’. S4M opens the way to an account of higher-order vagueness which avoids the paradoxes that have been thought to infect the notion. S4M is one of the modal counterparts of the intuitionistic sentential calculus and we use this fact to explain why IPC is the correct sentential logic to use when reasoning with vague statements. We also show that our key results go through in an intuitionistic version of S4M. Finally, we deploy our analysis to reply to Timothy Williamson’s objections to intuitionistic treatments of vagueness. (shrink)

We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics as K4, S4, S4.1, K4.3, GL, or Grz are undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4,K4] with product frames of arbitrary finite or infinite depth (with respect to both accessibility relations) can be decidable. In particular, if.

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.

In this paper, we propose a framework capable of dealing with anaphora and ellipsis which is both general and algorithmic. This generality is ensured by the compination of two general ideas. First, we use a dynamic semantics which reperent effects using a monad structure. Second we treat scopes flexibly, extending them as needed. We additionally implement this framework as an algorithm which translates abstract syntax to logical formulas. We argue that this framework can provide a unified account of a (...) large number of anaphoric phenomena. Specifically, we show its effectiveness in dealing with pronominal and VP-anaphora, strict and lazy pronouns, lazy identity, bound variable anaphora, e-type pronouns, and cataphora. This means that in particular we can handle complex cases like Bach–Peters sentences, which require an account dealing simultaneously with several phenomena. We use Haskell as a meta-language to present the theory, which also consitutes an implementation of all the phenomena discussed in the paper. To demonstrate coverage, we propose a test suite that can be used to evaluate computational approaches to anaphora. (shrink)

Designed for use by philosophy students, this 2006 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)

This paper is a continuation of the authors' attempts to deal with the notion of indistinguishability (or indiscernibility) from a logical point of view. Now we introduce a two-sorted first-order modal logic to enable us to deal with objects of two different species. The intended interpretation is that objects of one of the species obey the rules of standard S5, while the objects of the other species obey only the rules of a weaker notion of indiscernibility. Quantum mechanics motivates (...) the development. The basic idea is that in the ‘actual’ world things may be indiscernible but in another accessible world they may be distinguished in some way. That is, indistinguishability needs not be seen as a necessary relation. Contrariwise, things might be distinguished in the ‘actual’ world, but they may be indiscernible in another world. So, while two quantum systems may be entangled in the actual world, in some accessible world, due to a measurement, they can be discerned, and on the other hand, two initially separated quantum systems may enter in a state of superposition, losing their individualities. Two semantics are sketched for our system. The first is constructed within a standard set theory (the ZFC system is assumed at the metamathematics). The second one is constructed within the theory of quasi-sets, which we believe suits better the purposes of our logic and the mathematical treatment of certain situations in quantum mechanics. Some further philosophically related topics are considered. (shrink)

This book on modal logic is especially designed for philosophy students. It provides an accessible yet technically sound treatment of modal logic and its philosophical applications. Every effort is made to simplify the presentation by using diagrams instead 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-dicto (...) distinction. Discussion of philosophical issues concerning the development of modal logic is woven into the text. The book uses natural deduction systems, which are widely regarded as the easiest to teach and use. It also includes a diagram technique that extends the method of truth trees to modal logic. This provides a foundation for a novel method for showing completeness that is easy to extend to quantifiers. This second edition contains a new chapter on logics of conditionals, an updated and expanded bibliography, and is updated throughout. (shrink)

In this work Ockham proposes a theory of simple predication, which he uses in explicating the truth conditions of progressively more complicated kinds of propositions. His discussion includes what he takes to be the correct semantic treatment of quantified propositions, past tense and future tense propositions, and modal propositions, all of which are receiving much attention from contemporary philosophers. He also illustrates the use of exponential analysis to deal with propositions that prove troublesome in both semantic theory and other (...) disciplines, such as metaphysics, physics, and theology. This type of analysis plays an essential role in his substantive philosophical and theological works, and in many cases then can hardly be understood without a prior acquaintance with this section of the Summa. An introduction by Alfred J. Freddoso clarifies and summarizes Ockham's theory, discusses certain philosophical problems which it engenders, and proposes new interpretations for parts of it. The essay will be helpful both to those interested in Ockham as a historical figure and to those interested in his substantive systematic contributions to logical theory. (shrink)

For many recent readers of Hegel, Wilfrid Sellars’s 1956 London lectures on the “Myth of the Given” have signaled an important rapprochement between Hegelian and analytic traditions in philosophy. Here I want to explore the ideas of another philosopher, also active in London in the 1950s, who consciously pursued such a goal: John N. Findlay. The ideas that Findlay brought to Hegel—sometimes converging with, sometimes diverging from those of Sellars—had been informed by his earlier study of the Austrian philosopher Alexius (...) Meinong, and transformations of Meinong’s ideas by his student, the logician Ernst Mally. These ideas that Findlay found Hegel-friendly are ones that have had a particular bearing on more recent analytic modal metaphysics, especially via the work of Findlay’s own former student, Arthur Prior. Given this, we might not be surprised at the similarities between the type of actualist interpretation of modal logic that Prior offered in opposition to David Lewis’s variant on Leibnizian possibilism, and Hegel’s approach to the category of “Actuality” [Wirklichkeit] at the end of the Objective Logic of The Science of Logic. But the similarities, I suggest, do not end there, as elements of Hegel treatment of predication in the Subjective Logic parallel similar elements found in the work of Mally and, more recently, “modal actualists” such as Prior and Stalnaker. In this paper I explore some puzzling features of Hegel’s treatment of predication in the Subjective Logic from the point of view of the need for a logic for thought about the modally complex actual world, as Hegel conceived it. (shrink)

In the propositional modal treatment of two-variable first-order logic equality is modelled by a ‘diagonal’ constant, interpreted in square products of universal frames as the identity relation. Here we study the decision problem of products of two arbitrary modal logics equipped with such a diagonal. As the presence or absence of equality in two-variable first-order logic does not influence the complexity of its satisfiability problem, one might expect that adding a diagonal to product logics in general (...) is similarly harmless. We show that this is far from being the case, and there can be quite a big jump in complexity, even from decidable to the highly undecidable. Our undecidable logics can also be viewed as new fragments of first-order logic where adding equality changes a decidable fragment to undecidable. We prove our results by a novel application of counter machine problems. While our formalism apparently cannot force reliable counter machine computations directly, the presence of a unique diagonal in the models makes it possible to encode both lossy and insertion-error computations, for the same sequence of instructions. We show that, given such a pair of faulty computations, it is then possible to reconstruct a reliable run from them. (shrink)

We prove that everyn-modal logic betweenKnandS5nis undecidable, whenever n ≥ 3. We also show that each of these logics is non-finitely axiomatizable, lacks the product finite model property, and there is no algorithm deciding whether a finite frame validates the logic. These results answer several questions of Gabbay and Shehtman. The proofs combine the modal logic technique of Yankov–Fine frame formulas with algebraic logic results of Halmos, Johnson and Monk, and give a reduction of the representation problem (...) of finite relation algebras. (shrink)

Operators can be compared in at least two respects: expressive strength and deductive strength. Inspired by Hintikka’s treatment of question embedding verbs, the variations of noncontingency operator, and also the various combinations of modal operators and Boolean connectives, we propose a logic with strong noncontingency operator as the only primitive modality. The novel operator is deductively but not expressively stronger than both noncontingency operator and essence operator, and expressively but not deductively weaker than the necessity operator. The frame-definability power (...) of this new logic is in between standard modal logic and noncontingency logic. A notion of bisimulation is proposed to characterize this logic within standard modal logic and first-order logic. Axiomatizations over various frame classes are presented, among which the minimal logic is related to the treatment of an alternative semantics of the agreement operator proposed by Lloyd Humberstone. (shrink)

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 (...) class='Hi'>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)

In this paper, a timed modal logic L c is presented for the specification and verification of real-time systems. Several important results for L c are discussed. First we address the model checking problem and we show that it is an EXPTIME-complete problem. Secondly we consider expressiveness and we explain how to express strong timed bisimilarity and how to build characteristic formulas for timed automata. We also propose a compositional algorithm for L c model checking. Finally we consider several (...) control problems for which L c can be used to check controllability. (shrink)

We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics asK4,S4,S4.1,K4.3,GL, orGrzare undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4, K4] with product frames of arbitrary finite or infinite depth (with respect to both accessibility relations) can be decidable. In particular, ifl1andl2are classes of transitive frames such that (...) their depth cannot be bounded by any fixedn< ω, then the logic of the class {5ℑ1× ℑ2∣ ℑ1∈l1, ℑ2, ∈l2} is undecidable. (On the contrary, the product of, say,K4and the logic of all transitive Kripke frames of depth ≤n, for some fixedn< ω, is decidable.) The complexity of these undecidable logics ranges from r.e. to co-r.e. and Π11-complete. As a consequence, we give the first known examples of Kripke incomplete commutators of Kripke complete logics. (shrink)

We prove that everyn-modal logic betweenKnandS5nis undecidable, whenever n ≥ 3. We also show that each of these logics is non-finitely axiomatizable, lacks the product finite model property, and there is no algorithm deciding whether a finite frame validates the logic. These results answer several questions of Gabbay and Shehtman. The proofs combine the modal logic technique of Yankov–Fine frame formulas with algebraic logic results of Halmos, Johnson and Monk, and give a reduction of the representation problem (...) of finite relation algebras. (shrink)

Abstract.This paper is devoted to a logical and algebraic treatment of conditional probability. The main ideas are the use of non-standard probabilities and of some kind of standard part function in order to deal with the case where the conditioning event has probability zero, and the use of a many-valued modal logic in order to deal probability of an event φ as the truth value of the sentence φ is probable, along the lines of Hájek’s book [H98] and of (...) [EGH96]. To this purpose, we introduce a probabilistic many-valued logic, called FP(SŁΠ), which is sound and complete with respect a class of structures having a non-standard extension [0,1]⋆ of [0,1] as set of truth values. We also prove that the coherence of an assessment of conditional probabilities is equivalent to the coherence of a suitably defined theory over FP(SŁΠ) whose proper axioms reflect the assessment itself. (shrink)

We prove that everyn-modal logic betweenKnandS5nis undecidable, whenever n ≥ 3. We also show that each of these logics is non-finitely axiomatizable, lacks the product finite model property, and there is no algorithm deciding whether a finite frame validates the logic. These results answer several questions of Gabbay and Shehtman. The proofs combine the modal logic technique of Yankov–Fine frame formulas with algebraic logic results of Halmos, Johnson and Monk, and give a reduction of the (undecidable) representation (...) problem of finite relation algebras. (shrink)

This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, and (...) the modal operators regimenting the notion of 'intuition-that'. I argue that intuition-that can further be shown to entrain conceptual elucidation, by way of figuring as a dynamic-interpretational modality which induces the reinterpretation of both domains of quantification and the intensions and hyperintensions of mathematical concepts that are formalizable in monadic first- and second-order formal languages. Hyperintensionality is countenanced via a topic-sensitive epistemic two-dimensional truthmaker semantics. (shrink)

This is a thorough treatment of first-order modal logic. The book covers such issues as quantification, equality (including a treatment of Frege's morning star/evening star puzzle), the notion of existence, non-rigid constants and function symbols, predicate abstraction, the distinction between nonexistence and nondesignation, and definite descriptions, borrowing from both Fregean and Russellian paradigms.

In this paper we examine two approaches to the formal treatment of the notion of problem in the paradigm of algorithmic semantics. Namely, we will explore an approach based on Martin-Löf’s Constructive Type Theory, which can be seen as a direct continuation of Kolmogorov’s original calculus of problems, and an approach utilizing Tichý’s Transparent Intensional Logic, which can be viewed as a non-constructive attempt of interpreting Kolmogorov’s logic of problems. In the last section we propose Kolmogorov and CTT-inspired modifications (...) to TIL-based approach. The focus will be on non-empirical problems only. (shrink)

We prove that every n-modal logic between K n and S5 n is undecidable, whenever n ≥ 3. We also show that each of these logics is non- finitely axiomatizable, lacks the product finite model property, and there is no algorithm deciding whether a finite frame validates the logic. These results answer several questions of Gabbay and Shehtman. The proofs combine the modal logic technique of Yankov-Fine frame formulas with algebraic logic results of Halmos, Johnson and Monk, (...) and give a reduction of the (undecidable) representation problem of finite relation algebras. (shrink)

The goal of this paper is to introduce a new Gentzen formulation of the modal logic S5. The history of this problem goes back to the fifties where a counter-example to cut-elimination was given for an otherwise natural and straightforward formulation of S5. Since then, several cut-free Gentzen style formulations of S5 have been given. However, all these systems are technically involved, and furthermore, they differ considerably from Gentzen's original formulation of classical logic. In this paper we give a (...) new sequent system for S5 which is a straightforward and technically simple extension of Gentzen's original sequent system for classical logic. A characteristic feature is the notion of a connection in a proof. The new system satisfies cut-elimination as well as the subformula property. Cut-elimination is proved by giving an algorithm for eliminating cuts. The fact that we give an algorithm for eliminating cuts makes it clear that our system is susceptible to a formulae-as-types computational interpretation. (shrink)

In classical modal semantics, a binary accessibility relation connects worlds. In this paper, we present a uniform and systematic treatment of modal semantics with a continuous accessibility relation alongside the continuous accessibility modal logics that they model. We develop several such logics for a variety of philosophical applications. Our main conclusions are as follows. Modal logics with a continuous accessibility relation are sound and complete in their natural classes of models. The class of (...) Kripke frames where a continuous accessibility relation has a magnitude characterizing its degree of accessibility is not modally definable, and this has unappreciated significance to completeness proofs for such logics, revealing a methodological advantage of using classical multimodal semantics over fuzzy modal semantics. There is a pseudometric space modal logic that is complete in the class of pseudometric spaces, a natural semantic setting for quantitative modal reasoning about similarity. There is a metric space modal logic that is complete in the class of metric spaces, a natural semantic setting for quantitative modal reasoning about neighborhoods and counterfactual stability. There is a real line continuous temporal logic that is canonical for real lines, a natural semantic setting for quantitative modal reasoning about time. (shrink)

We introduce reference structures — a basic mathematical model of a data organization capable of storing and utilizing information about its addresses. A propositional labeled modal language is used as a specification and programming language for reference structures; the satisfiability algorithm for modal language gives a method of building and optimizing reference structures satisfying a given formula. Corresponding labeled modal logics are presented, supplied with cut free axiomatizations, completeness and decidability theorems are proved. Initialization of typed (...) variables in some programming languages is presented as an example of a reference structure building. (shrink)