The paper deals with polymodal languages combined with standard semantics defined by means of some conditions on the frames. So, a notion of "polymodal base" arises which provides various enrichments of the classical modal language. One of these enrichments, viz. the base £(R,-R), with modalities over a relation and over its complement, is the paper's main paradigm. The modal definability (in the spirit of van Benthem's correspondence theory) of arbitrary and ~-elementary classes of frames in this base and in some (...) of its extensions, e.g., £(R,-R,R-1 ,_R-1), £(R,-R,=I=) etc., is described, and numerous examples of conditions definable there, as well as undefinable ones, are adduced. (shrink)

The calculus of relations was created and developed in the second half of the nineteenth century by Augustus De Morgan, Charles Sanders Peirce, and Ernst Schröder. In 1940 Alfred Tarski proposed an axiomatization for a large part of the calculus of relations. In the next decade Tarski's axiomatization led to the creation of the theory of relation algebras, and was shown to be incomplete by Roger Lyndon's discovery of nonrepresentable relation algebras. This paper introduces the calculus of relations and the (...) theory of relation algebras through a review of these historical developments. (shrink)

Montague, Prior, von Wright and others drew attention to resemblances between modal operators and quantifiers. In this paper we show that classical quantifiers can, in fact, be regarded as S5-like operators in a purely propositional modal logic. This logic is axiomatized and some interesting fragments of it are investigated.

We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...) iff Vy(y ≠ x → y ⊧ φ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in ℒ $_{c}$ . Strong completeness of the normal ℒ $_{c}$ logics is proved with respect to models in which all worlds are named. Every ℒ $_{c}$ -logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from ℒ to ℒ $_{c}$ are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched. (shrink)

The main result of the present paper — Theorem 3 — establishes the equivalence of the interpolation and amalgamation properties for a large family of logics and their associated classes of matrices.

The purpose of the present paper is to show that modal propositional logics can be interpreted in a logic based on relational calculus. We consider languages with necessity operators [R], where R is an accessibility relation expression representing an element of the algebra of binary relations with operations −,∪,∩, −1 , ◦. The relational logic is based on relational calculus enriched by operations of weakest prespecification and weakest postspecification introduced in Hoare and He Jifeng and investigated in He Jifeng et (...) al . The logic is an extension of the system introduced in Or lowska and investigated in Buszkowski and Or lowska. (shrink)

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)

We consider some modal languages with a modal operator $D$ whose semantics is based on the relation of inequality. Basic logical properties such as definability, expressive power and completeness are studied. Also, some connections with a number of other recent proposals to extend the standard modal language are pointed at.

The logic of information flow has applications in both computer science and natural language processing and is a growing area within mathematical and philosophical logic.

This volume is not restricted to papers presented at the 1988 Colloquium, but instead aims to provide the reader with a (relatively) coherent reading on Algebraic Logic, with an emphasis on current research. To help the non-specialist reader, the book contains an introduction to cylindric and relation algebras by Roger D. Maddux and an introduction to Boolean Algebras by Bjarni Joacute;nsson.

This volume contains a selection of papers presented at a Seminar on Intensional Logic held at the University of Amsterdam during the period September 1990-May 1991. Modal logic, either as a topic or as a tool, is common to most of the papers in this volume. A number of the papers are con cerned with what may be called well-known or traditional modal systems, but, as a quick glance through this volume will reveal, this by no means implies that they (...) walk the beaten tracks. In deed, such contributions display new directions, new results, and new techniques to obtain familiar results. Other papers in this volume are representative examples of a current trend in modal logic: the study of extensions or adaptations of the standard sys tems that have been introduced to overcome various shortcomings of the latter, especially their limited expressive power. Finally, there is another major theme that can be discerned in the vol ume, a theme that may be described by the slogan 'representing changing information. ' Papers falling under this heading address long-standing issues in the area, or present a systematic approach, while a critical survey and a report contributing new techniques are also included. The bulk of the papers on pure modal logic deal with theoreti calor even foundational aspects of modal systems. (shrink)

2014 Reprint of 1962 Edition. Full facsimile of the original edition, not reproduced with Optical Recognition Software. In "Algebraic Logic" Halmos devised polyadic algebras, an algebraic version of first-order logic differing from the better known cylindric algebras of Alfred Tarski and his students. An elementary version of polyadic algebra is described in monadic Boolean algebra. This book addresses some of the problems of mathematical logic and the theory of polyadic Boolean algebras in particular. It is intended to be an efficient (...) way of treating algebraic logic in a unified manner. (shrink)

The logical theory which is called thecalculus of (binary) relations, and which will constitute the subject of this paper, has had a strange and rather capricious line of historical development. Although some scattered remarks regarding the concept of relations are to be found already in the writings of medieval logicians, it is only within the last hundred years that this topic has become the subject of systematic investigation. The first beginnings of the contemporary theory of relations are to be found (...) in the writings of A. De Morgan, who carried out extensive investigations in this domain in the fifties of the Nineteenth Century. De Morgan clearly realized the inadequacy of traditional logic for the expression and justification, not merely of the more intricate arguments of mathematics and the sciences, but even of simple arguments occurring in every-day life; witness his famous aphorism, that all the logic of Aristotle does not permit us, from the fact that a horse is an animal, to conclude that the head of a horse is the head of an animal. In his effort to break the bonds of traditional logic and to expand the limits of logical inquiry, he directed his attention to the general concept of relations and fully recognized its significance. Nevertheless, De Morgan cannot be regarded as the creator of the modern theory of relations, since he did not possess an adequate apparatus for treating the subject in which he was interested, and was apparently unable to create such an apparatus. His investigations on relations show a lack of clarity and rigor which perhaps accounts for the neglect into which they fell in the following years. (shrink)

The problem of whether Lambek Calculus is complete with respect to (w.r.t.) relational semantics, has been raised several times, cf. van Benthem (1989a) and van Benthem (1991). In this paper, we show that the answer is in the affirmative. More precisely, we will prove that that version of the Lambek Calculus which does not use the empty sequence is strongly complete w.r.t. those relational Kripke-models where the set of possible worlds,W, is a transitive binary relation, while that version of the (...) Lambek Calculus where we admit the empty sequence as the antecedent of a sequent is strongly complete w.r.t. those relational models whereW=U×U for some setU. We will also look into extendability of this completeness result to various fragments of Girard's Linear Logic as suggested in van Benthem (1991), p. 235, and investigate the connection between the Lambek Calculus and language models. (shrink)

This investigation concerns representations of time by means of intervals, stemming from work of Allen and van Benthem . Allen described an Interval Calculus of thirteen binary relations on convex intervals over a linear order . He gave a practical algorithm for checking the consistency of a sublclass of Boolean constraints. ;First, we describe a completeness theorem for Allen's calculus, in its corresponding formulation as a first-order theory LM. LM is countably categorical, and axiomatises the complete theory of intervals over (...) a dense unbounded linear order. Its only countable model up to isomorphism is the non-trivial intervals over the rational numbers. ;Algorithms are given for quantifer-elimination, consistency checking, and satisfaction of arbitrary first-order formulas in the Interval Calculus. ;A natural countable model of the calculus is presented, the TUS, in which clock- and calendar-time may be represented in a straightforward way. ;Allen and Hayes described a first-order theory of intervals in . It is shown that the models of the theory are precisely the interval structures over an arbitrary unbounded linear order. ;An extension of the calculus to intervals which are union-of-convex is considered, introduced by concerns over the represention of interruptible processes. A taxonomy of necessary relations between union-of-convex intervals is given, and it is considered how to generalise to arbitrary non-convex intervals. Use of the extension is illustrated with an example of synthesising concurrent processes from high-level specifications. ;The extended calculus may be implemented in a high-level system with logic programming and data-types of sequence and set, and this feature is illustrated with a partial implementation of the TUS in such a system. (shrink)

Neither question (1) nor question (2) posed on page 446 have been adequately answered in this paper. Regarding (1) we have merely given functor maps onto the object languages of physical theories and regarding (2) we have merely described the algebraic structure of observables. A more satisfactory treatment will most likely involve (1) a generalization to algebraic categories, universal algebra and model theory in such a way as to capture the full inference structure of (perhaps van Fraassen's modal) quantum logic, (...) and (2) the introduction of the category of differentiable manifolds in order to capture the full symplectic structure of (perhaps Chernoff-Marsden's) Hamiltonian dynamics. (See van Fraassen [4] and Chernoff-Marsden [5] in Other References.)Finally, the intriguing suggestion of Finkelstein that “category theory is to metaphysics what group theory is to physics” deserves serious consideration. Indeed, although the theme has not been touched on explicitly in this paper it was central in motivating the project initially. However, it is more properly to be developed in a context external to a symposium on quantum logic. (shrink)

This is a survey of results on interpolation in propositional normal modal logics. Interpolation properties of these logics are closely connected with amalgamation properties of varieties of modal algebras. Therefore, the results on interpolation are also reformulated in terms of amalgamation.

This volume constitutes the Proceedings of a workshop on formal seman tics of natural languages which was held in Tiibingen from the 1st to the 3rd of December 1977. Its main body consists of revised versions of most of the papers presented on that occasion. Three supplementary papers are included because they seem to be of particular interest in their respective fields. The area covered by the work of scholars engaged in philosophical logic and the formal analysis of natural languages (...) testifies to the live liness in those disciplines. It would have been impossible to aim at a complete documentation of relevant research within the limits imposed by a short conference whereas concentration on a single topic would have conveyed the false impression of uniformity foreign to a young and active field. It is hoped that the essays collected in this volume strike a reasonable balance between the two extremes. The topics discussed here certainly belong to the most important ones enjoying the attention of linguists and philosophers alike: the analysis of tense in formal and natural languages, the quickly expanding domain of generalized quantifiers, the problem of vagueness, the connected areas of pronominal reference and presupposition and, last but not least, modal logic as a sort of all-embracing theoretical framework. The workshop which led to this collection formed part of the activities celebrating the 500th anniversary of Tiibingen University. (shrink)

We discuss a `negative' way of defining frame classes in (multi)modal logic, and address the question of whether these classes can be axiomatized by derivation rules, the `non-ξ rules', styled after Gabbay's Irreflexivity Rule. The main result of this paper is a metatheorem on completeness, of the following kind: If Λ is a derivation system having a set of axioms that are special Sahlqvist formulas and Λ+ is the extension of Λ with a set of non-ξ rules, then Λ+ is (...) strongly sound and complete with respect to the class of frames determined by the axioms and the rules. (shrink)

In this work, we attempt to alleviate three equivalent negative results. These are non-axiomatizability of the valid formula schemas of first order logic, non-axiomatizability of any propositional logic equivalent with classical first order logic , and non-axiomatizability of the class of representable cylindric algebras . Here we present two finite schema axiomatizable classes of algebras that contain, as a reduct, the class of representable quasi-polyadic algebras and the class of representable cylindric algebras, respectively. We establish positive results in the direction (...) of finitary algebraization of first order logic without equality as well as that with equality. Finally, we will indicate how these constructions can be applied to turn negative results , above to positive one. (shrink)

We prove that the equational theory of a semigroups becomes undecidable if we add a semilattice structure with a ‘touch of symmetric difference’. As a corollary we obtain that the variety of all Boolean algebras with an associative binary operator has a ‘hereditarily’ undecidable equational theory. Our results have implications in logic, e.g. they imply undecidability of modal logics extending the Lambek Calculus and undecidability of Arrow Logics with an associative arrow modality.