Over the last twenty years, in all of these neighbouring fields, modal systems have been developed that we call multi-dimensional. (Our definition of multi ...

Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving (...) objects. To study the computational behaviour of many-dimensional modal logics is the main aim of this book. On the one hand, it is concerned with providing a solid mathematical foundation for this discipline, while on the other hand, it shows that many seemingly different applied many-dimensional systems (e.g., multi-agent systems, description logics with epistemic, temporal and dynamic operators, spatio-temporal logics, etc.) fit in perfectly with this theoretical framework, and so their computational behaviour can be analyzed using the developed machinery. We start with concrete examples of applied one- and many-dimensional modal logics such as temporal, epistemic, dynamic, description, spatial logics, and various combinations of these. Then we develop a mathematical theory for handling a spectrum of 'abstract' combinations of modal logics - fusions and products of modal logics, fragments of first-order modal and temporal logics - focusing on three major problems: decidability, axiomatizability, and computational complexity. Besides the standard methods of modal logic, the technical toolkit includes the method of quasimodels, mosaics, tilings, reductions to monadic second-order logic, algebraic logic techniques. Finally, we apply the developed machinery and obtained results to three case studies from the field of knowledge representation and reasoning: temporal epistemic logics for reasoning about multi-agent systems, modalized description logics for dynamic ontologies, and spatio-temporal logics. The genre of the book can be defined as a research monograph. It brings the reader to the front line of current research in the field by showing both recent achievements and directions of future investigations (in particular, multiple open problems). On the other hand, well-known results from modal and first-order logic are formulated without proofs and supplied with references to accessible sources. The intended audience of this book is logicians as well as those researchers who use logic in computer science and artificial intelligence. More specific application areas are, e.g., knowledge representation and reasoning, in particular, terminological, temporal and spatial reasoning, or reasoning about agents. And we also believe that researchers from certain other disciplines, say, temporal and spatial databases or geographical information systems, will benefit from this book as well. Key Features: Integrated approach to modern modal and temporal logics and their applications in artificial intelligence and computer science Written by internationally leading researchers in the field of pure and applied logic Combines mathematical theory of modal logic and applications in artificial intelligence and computer science Numerous open problems for further research Well illustrated with pictures and tables. (shrink)

We show that every modal logic (with arbitrary many modalities of arbitrary arity) can be seen as a multi-dimensional modal logic in the sense of Venema. This result shows that we can give every modal logic a uniform "concrete" semantics, as advocated by Henkin et al. This can also be obtained using the unravelling method described by de Rijke. The advantage of our construction is that the obtained class of frames is easily (...) seen to be elementary and that the worlds have a more uniform character. (shrink)

We consider the problem of axiomatizing various natural "successor" logics for 2-dimensional integral spacetime. We provide axiomatizations in monomodal and multimodal languages, and prove completeness theorems. We also establish that the irreflexive successor logic in the "standard" modal language (i.e. the language containing □ and ◊) is not finitely axiomatizable.

ABSTRACT The notion of n-dimensional arrow structure is introduced, which for n = 2 coincides with the notion of directed multi-graph. In part I of the paper several first-order and modal languages connected with arrow structures are studied and their expressive power is compared. Part II is devoted to the axiomatization of some arrow logics. At the end some further perspectives of ?arrow approach? are discussed.

We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E δ and A δ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. (...) We also show that the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for ctl. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional ctl logic. (shrink)

We define a multi-modal version of Computation Tree Logic (CTL) by extending the language with path quantifiers $E^\delta $ and $E^\delta $ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a CTL axiomatisation for each dimension. Completeness is proved by employing the completeness result for CTL to obtain a model along each dimension in turn. (...) We also show that the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for CTL. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional CTL logic. (shrink)

We define a multi-modal version of Computation Tree Logic ( ctl ) by extending the language with path quantifiers E δ and A δ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension (...) in turn. We also show that the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for ctl. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional ctl logic. (shrink)

In this paper we present tableau methods for two-dimensional modal logics. Although models for such logics are well known, proof systems remain rather unexplored as most of their developments have been purely axiomatic. The logics herein considered contain first-order quantifiers with identity, and all the formulas in the language are doubly-indexed in the proof systems, with the upper indices intuitively representing the actual or reference worlds, and the lower indices representing worlds of evaluation—first and second dimensions, respectively. The (...) tableaux modulate over different notions of validity such as local, general, and diagonal, besides being general enough for several two-dimensional logics proposed in the literature. We also motivate the introduction of a new operator into two-dimensional languages and explore some of the philosophical questions raised by it concerning the relations there are between actuality, necessity, and the a priori, that seem to undermine traditional intuitive interpretations of two-dimensional operators. (shrink)

We show the first examples of recursively enumerable (even decidable) two-dimensional products of finitely axiomatisable modal logics that are not finitely axiomatisable. In particular, we show that any axiomatisation of some bimodal logics that are determined by classes of product frames with linearly ordered first components must be infinite in two senses: It should contain infinitely many propositional variables, and formulas of arbitrarily large modal nesting-depth.

We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E δ and A δ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. (...) We also show that the logic is decidable and that its satisfiability problem is no harder than the corresponding problem for ctl. We then demonstrate how Normative Systems can be conceived as a natural interpretation of such a multi-dimensional ctl logic. (shrink)

The two-dimensional modal logic of Davies and Humberstone [3] is an important aid to our understanding the relationship between actuality, necessity and a priori knowability. I show how a cut-free hypersequent calculus for 2D modal logic not only captures the logic precisely, but may be used to address issues in the epistemology and metaphysics of our modal concepts. I will explain how the use of our concepts motivates the inference rules of the sequent (...) calculus, and then show that the completeness of the calculus for Davies–Humberstone models explains why those concepts have the structure described by those models. The result is yet another application of the completeness theorem. (shrink)

Notions of context for natural language interpretation are factored in terms of three processes: translation, entailment and attunement. The processes are linked by accessibility relations of the kind studied in many-dimensional modal logic, modulo complications from constraints between translation and entailment (violations in which may trigger re-attunement) and from refinement and underspecification.

We present an extension of the mosaic method aimed at capturing many-dimensional modal logics. As a proof-of-concept, we define the method for logics arising from the combination of linear tense operators with an “orthogonal” S5-like modality. We show that the existence of a model for a given set of formulas is equivalent to the existence of a suitable set of partial models, called mosaics, and apply the technique not only in obtaining a proof of decidability and a proof (...) of completeness for the corresponding Hilbert-style axiomatization, but also in the development of a mosaic-based tableau system. We further consider extensions for dealing with the case when interactions between the two dimensions exist, thus covering a wide class of bundled Ockhamist branching-time logics, and present for them some partial results, such as a non-analytic version of the tableau system. (shrink)

Conceived by Johan van Benthem and Yde Venema, arrow logic started as an attempt to give a general account of the logic of transitions. The generality of the approach provided a wide application area ranging from philosophy to computer science. The book gives a comprehensive survey of logical research within and around arrow logic. Since the natural operations on transitions include composition, inverse and identity, their logic, arrow logic can be studied from two different perspectives, (...) and by two (complementary) methodologies: modal logic and the algebra of relations. Some of the results in this volume can be interpreted as price tags. They show what the prices of desirable properties, such as decidability, (finite) axiomatisability, Craig interpolation property, Beth definability etc. are in terms of semantic properties of the logic. The research program of arrow logic has considerably broadened in the last couple of years and recently also covers the enterprise to explore the border between decidable and undecidable versions of other applied logics. The content of this volume reflects this broadening. The editors included a number of papers which are in the spirit of this generalised research program. (shrink)

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for some languages and spaces, no standard modal deductive system is strongly complete.

Many authors have noted that there are types of English modal sentences cannot be formalized in the language of basic first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who is actually rich could have been poor.” In response to this lack of expressive power, many authors have discussed extensions of first-order modal logic with two-dimensional operators. But claims about the relative expressive power (...) of these extensions are often justified only by example rather than by rigorous proof. In this paper, we provide proofs of many of these claims and present a more complete picture of the expressive landscape for such languages. (shrink)

We consider a version of so called T x W logic for historical necessity in the sense of R.H. Thomason (1984), which is somewhat special in three respects: (i) it is explicitly based on two-dimensional modal logic in the sense of Segerberg (1973); (ii) for reasons of applicability to interesting fields of philosophical logic, it conceives of time as being discrete and finite in the sense of having a beginning and an end; and (iii) it (...) utilizes the technique of systematic frame constants in order to handle the problem of irreflexivity in tense logics, well known since Gabbay (1981). Axiomatizations are given for two infinite hierarchies of two-dimensional modal tense logics, one without and one with the characteristic operators for historical necessity and possibility. Strong and weak completeness results are obtained for both hierarchies as well as a result to the effect that two approaches to their semantics are equivalent, much in the spirit of Di Maio and Zanardo (1996) and von Kutschera (1997). (shrink)

This paper concerns the applications of two-dimensional modal semantics to the explanation of the contents of speech and thought. Different interpretations and applications of the apparatus are contrasted. First, it is argued that David Kaplan's two-dimensional semantics for indexical expressions is different from the use that I made of a formally similar framework to represent the role of contingent information in the determination of what is said. But the two applications are complementary rather than conflicting. Second, my (...) interpretation of the apparatus is contrasted with that of David Chalmers, Frank Jackson, and David Lewis. It is argued that this difference reflects a contrast between internalist and externalist approaches to the problem of intentionality. (shrink)

The paper aims at providing the multi-modal propositional logic LTK with a sound and complete axiomatisation. This logic combines temporal and epistemic operators and focuses on m odeling the behaviour of a set of agents operating in a system on the background of a temporal framework. Time is represented as linear and discrete, whereas knowledge is modeled as an S5-like modality. A further modal operator intended to represent environment knowledge is added to the system in (...) order to achieve the expressive power sufficient to describe the piece of information available to the agents at each moment in the flow of time. (shrink)

A number of significant contributions in the last four decades show that non-normal modal logics can be fruitfully employed in several applied fields. Well-known domains are epistemic logic, deontic logic, and systems capturing different aspects of action and agency such as the modal logic of agency, concurrent propositional dynamic logic, game logic, and coalition logic. Semantics for such logics are traditionally based on neighbourhood models. However, other model-theoretic semantics can be used for (...) this purpose. Here, we systematically study multi-relational structures, whose investigation is still relatively underdeveloped. After a brief introduction to two different versions of multi-relational semantics – which we call strong and weak multi-relational semantics – we proceed to study several modal schemata. Special attention is paid to the schemata CON and D. Finally we offer completeness proofs for several systems using both strong and weak semantic tools: The proofs thus cover both classical system.. (shrink)

This paper concerns modal logics appearing from the temporal ordering of domains in two-dimensional Minkowski spacetime. As R. Goldblatt has proved recently, the logic of the whole plane isS4.2. We consider closed or open convex polygons and closed or open domains bounded by simple differentiable curves; this leads to the logics:S4,S4.1,S4.2 orS4.1.2.

We study the modal logic M L r of the countable random frame, which is contained in and `approximates' the modal logic of almost sure frame validity, i.e. the logic of those modal principles which are valid with asymptotic probability 1 in a randomly chosen finite frame. We give a sound and complete axiomatization of M L r and show that it is not finitely axiomatizable. Then we describe the finite frames of that (...) class='Hi'>logic and show that it has the finite frame property and its satisfiability problem is in EXPTIME. All these results easily extend to temporal and other multi-modal logics. Finally, we show that there are modal formulas which are almost surely valid in the finite, yet fail in the countable random frame, and hence do not follow from the extension axioms. Therefore the analog of Fagin's transfer theorem for almost sure validity in first-order logic fails for modal logic. (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)

Many powerful logics exist today for reasoning about multi-agent systems, but in most of these it is hard to reason about an infinite or indeterminate number of agents. Also the naming schemes used in the logics often lack expressiveness to name agents in an intuitive way.To obtain a more expressive language for multi-agent reasoning and a better naming scheme for agents, we introduce a family of logics called term-modal logics. A main feature of our logics is the (...) use of modal operators indexed by the terms of the logics. Thus, one can quantify over variables occurring in modal operators. In term-modal logics agents can be represented by terms, and knowledge of agents is expressed with formulas within the scope of modal operators. (shrink)

ABSTRACT The two main directions pursued in the present paper are the following. The first direction was started by Pigozzi in 1969. In [Mak 91] and [Mak 79] Maksimova proved that a normal modal logic has the Craig interpolation property iff the corresponding class of algebras has the superamalgamation property. In this paper we extend Maksimova's theorem to normal multi-modal logics with arbitrarily many, not necessarily unary modalities, and to not necessarily normal multi-modal logics (...) with modalities of ranks smaller than 2. To extend the characterization beyond multi-modal logics, we look at arbitrary algebraizable logics. We will introduce an algebraic property equivalent with the Craig interpolation property in algebraizable logics, and prove that the superamalgamation property implies the Craig interpolation property. The problem of extending the characterization result to non-normal non-unary modal logics also will be discussed. In the second direction pursued herein: for non-normal modal logic with one unary modality Lemmon [Lem 66] gave a possible worlds semantics. Here we give a more general possible worlds semantics for not necessarily normal multi-modal logics with arbitrarily many not necessarily unary modalities. Strongly related to the above is the theorem, proved, e.g., in Jóns son-Tarski [JT 52] and Henkin-Monk-Tarski [HMT 71], that every normal Boolean algebra with operators can be represented as a subalgebra of the complex algebra of some relational structure. We extend this result to not necessarily normal BAO's as follows. We define partial relational structures and show that every not necessarily normal BAO is embeddable into the complex algebra of a partial relational structure. This gives a possible worlds semantics for not necessarily normal multi-modal logics. (shrink)

The paper studies many-dimensional modal logics corresponding to products of Kripke frames. It proves results on axiomatisability, the finite model property and decidability for product logics, by applying a rather elaborated modal logic technique: p-morphisms, the finite depth method, normal forms, filtrations. Applications to first order predicate logics are considered too. The introduction and the conclusion contain a discussion of many related results and open problems in the area.

Treating the existential quantification ∃ν i as a diamond $\diamond_i$ and the identity ν i = ν j as a constant δ ij , we study restricted versions of first order logic as if they were modal formalisms. This approach is closely related to algebraic logic, as the Kripke frames of our system have the type of the atom structures of cylindric algebras; the full cylindric set algebras are the complex algebras of the intended multidimensional frames called (...) cubes. The main contribution of the paper is a characterization of these cube frames for the finite-dimensional case and, as a consequence of the special form of this characterization, a completeness theorem for this class. These results lead to finite, though unorthodox, derivation systems for several related formalisms, e.g. for the valid n-variable first order formulas, for type-free valid formulas and for the equational theory of representable cylindric algebras. The result for type-free valid formulas indicates a positive solution to Problem 4.16 of Henkin, Monk and Tarski [16]. (shrink)

The aim of this paper is to study the n-variable fragment of first order logic from a modal perspective. We define a modal formalism called cylindric mirror modal logic, and show how it is a modal version of first order logic with substitution. In this approach, we can define a semantics for the language which is closely related to algebraic logic, as we find Polyadic Equality Algebras as the modal or complex (...) algebras of our system. The main contribution of the paper is a characterization of the intended ‘mirror cubic’ frames of the formalisms and, a consequence of the special form of this characterization, a completeness theorem for these intended frames. As a consequence, we find complete finite yet unorthodox derivation systems for the equational theory of finite-dimensional representable polyadic equality algebras. (shrink)

We present three examples of topological semantics for intuitionistic modal logic with one modal operator □. We show that it is possible to treat neighborhood models, introduced earlier, as topological or multi-topological. From the neighborhood point of view, our method is based on differences between properties of minimal and maximal neighborhoods. Also we propose transformation of multitopological spaces into the neighborhood structures.

Fix 2 < n < ω and let C A n denote the class of cylindric algebras of dimension n. Roughly, C A n is the algebraic counterpart of the proof theory of first-order logic restricted to the first n var...