Skip to main content Skip to main navigation menu Skip to site footer
  • Register
  • Login
  • Language
    • English
    • Język Polski
  • Menu
  • Home
  • Current
  • Archives
  • Online First Articles
  • About
    • About the Journal
    • Submissions
    • Editorial Team
    • Advisory Board
    • Peer Review Process
    • Logic and Logical Philosophy Committee
    • Open Access Policy
    • Privacy Statement
    • Contact
  • Register
  • Login
  • Language:
  • English
  • Język Polski

Logic and Logical Philosophy

Distributed Relation Logic
  • Home
  • /
  • Distributed Relation Logic
  1. Home /
  2. Archives /
  3. Vol. 26 No. 1 (2017): March /
  4. Articles

Distributed Relation Logic

Authors

  • Gerard Allwein Naval Research Laboratory, Washington
  • William L. Harrison University of Missouri
  • Thomas Reynolds University of Missouri

DOI:

https://doi.org/10.12775/LLP.2016.017

Keywords

relation algebra, multisorted algebra, distributed logic, Kripke frames, Kripke models

Abstract

We extend the relational algebra of Chin and Tarski so that it is multisorted or, as we prefer, typed. Each type supports a local Boolean algebra outfitted with a converse operator. From Lyndon, we know that relation algebras cannot be represented as proper relation algebras where a proper relation algebra has binary relations as elements and the algebra is singly-typed. Here, the intensional conjunction, which was to represent relational composition in Chin and Tarski, spans three different local algebras, thus the term distributed in the title. Since we do not rely on proper relation algebras, we are free to re-express the algebras as typed. In doing so, we allow many different intensional conjunction operators.

We construct a typed logic over these algebras, also known as heterogeneous algebras of Birkhoff and Lipson. The logic can be seen as a form of relevance logic with a classical negation connective where the Routley-Meyer star operator is reified as a converse connective in the logic. Relevance logic itself is not typed but our work shows how it can be made so. Some of the properties of classical relevance logic are weakened from Routley-Meyer’s version which is too strong for a logic over relation algebras.

Author Biographies

William L. Harrison, University of Missouri

Dept. of Computer Science

Thomas Reynolds, University of Missouri

Dept. of Computer Science

References

Adámek, J., and J. Rosický, Locally Presentable and Accessible Categories, Lecture Note Series 189, London Mathematical Society, 1994. DOI: 10.1017/CBO9780511600579

Allwein, G., H. Demir, and L. Pike, “Logics for classes of Boolean monoids”, Journal of Logic, Language and Information, 13, 3 (2004): 241–266. DOI: 10.1023/B:JLLI.0000028336.64373.f6

Allwein, G., W. Harrison, and D. Andrews, “Simulation logic”, Logic and Logical Philosophy, 23, 3 (2014): 277–299. DOI: 10.12775/LLP.2013.027

Allwein, G., and W.L. Harrison, “Distributed modal logic”, pages 331–362 in Katalin Bimbó (ed.), J. Michael Dunn on Information Based Logic, Outstanding Contributions to Logic, Springer-Verlag, 2016. DOI: 10.1007/978-3-319-29300-4_16

Anderson, A.R., and N.D. Belnap, Jr., Entailment: The Logic of Relevance and Necessity, volume I, Princeton University Press, 1975.

Birkhoff, G., Lattice Theory, Third Edition, American Mathematical Society, 1967.

Birkhoff, G., and J.D. Lipson, “Heterogeneous algebras”, Journal of Computational Theory, 8 (1968): 115–133.

Blackburn, P., M. de Rijke, and Y. Venema, Modal Logic, Cambridge Tracts in Theoretical Computer Science, No. 53, Cambridge University Press, 2001. DOI: 10.1017/CBO9781107050884

Chin, L.H., and A. Tarski, “Distributive and modular laws in the arithmetic of relation algebras”, University of California Publications in Mathematics, 1951.

Dunn, J.M., “Gaggle theory: An abstraction of Galois connections and residuation with applications to negation and various logical operations”, pages 31–51 in Logics in AI, Proceedings European Workshop JELIA, LNCS 478, Springer-Verlag, 1990. DOI: 10.1007/BFb001843

Dunn, J.M., and G. Hardegree, Algebraic Methods in Philosophical Logic, Oxford Logic Guides 41, Oxford University Press, 2001.

Hoare, C.A.R., and J. He, “A weakest pre-specification”, Inform. Process.

Jónsson, B., and A. Tarski, “Boolean algebras with operators. Parts 1 and 2”, American Journal of Mathematics, 73–74 (1951–1952): 891–939, 127–162. DOI: 10.2307/2372074

Jónsson, B., and C. Tsinakis, “Relation algebras as residuated Boolean algebras”, Algebra Universalis, 30 (1993): 469–478.

Ng, K.C., “Relation algebras with transitive closure”, PhD thesis, University of California, Berkeley, 1984.

Pratt, V.R., “Dynamic algebras as a well behaved fragment of relation algebras”, Chapter 5 in Proceedings, Algebra and Computer Science, Lecture Notes in Computer Science, Springer-Verlag, 1990. DOI: 10.1007/BFb0043079

Routley, R., and R.K. Meyer, “The semantics of entailment”, pages 194–243 in H. Leblanc (ed.), Truth, Syntax, and Modality, Studies in Logic and the Foundations of Mathematics, North Holland, 1973. DOI: 10.1016/S0049-237X(08)71541-6

Routley, R., R.K. Meyer, V. Plumwood, and R.T. Brady, Relevant Logics and Their Rivals, Ridgeview Publishing Company, 1982.

Sahlqvist, H., “Completeness and correspondence in the first and second order semantics for modal logic”, pages 110–143 in Proceedings of the Third Scandanavian Logic Symposium, Uppsala, 1973, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, 1975. DOI: 10.1016/S0049-237X(08)70728-6

Stone, M.H., “The theory of representation for Boolean algebras”, Transactions of the American Mathematical Society, 40 (1936): 37–111. DOI: 10.2307/1989664

van Benthem, J., Modal Logic and Classical Logic, Bibliopolis, 1983.

Logic and Logical Philosophy

Downloads

  • PDF

Published

2016-07-19

How to Cite

1.
ALLWEIN, Gerard, HARRISON, William L. and REYNOLDS, Thomas. Distributed Relation Logic. Logic and Logical Philosophy. Online. 19 July 2016. Vol. 26, no. 1, pp. 19-61. [Accessed 16 May 2025]. DOI 10.12775/LLP.2016.017.
  • ISO 690
  • ACM
  • ACS
  • APA
  • ABNT
  • Chicago
  • Harvard
  • IEEE
  • MLA
  • Turabian
  • Vancouver
Download Citation
  • Endnote/Zotero/Mendeley (RIS)
  • BibTeX

Issue

Vol. 26 No. 1 (2017): March

Section

Articles

Stats

Number of views and downloads: 525
Number of citations: 0

Crossref
Scopus
Google Scholar
Europe PMC

Search

Search

Browse

  • Browse Author Index
  • Issue archive

User

User

Current Issue

  • Atom logo
  • RSS2 logo
  • RSS1 logo

Information

  • For Readers
  • For Authors
  • For Librarians

Newsletter

Subscribe Unsubscribe

Language

  • English
  • Język Polski

Tags

Search using one of provided tags:

relation algebra, multisorted algebra, distributed logic, Kripke frames, Kripke models
Up

Akademicka Platforma Czasopism

Najlepsze czasopisma naukowe i akademickie w jednym miejscu

apcz.umk.pl

Partners

  • Akademia Ignatianum w Krakowie
  • Akademickie Towarzystwo Andragogiczne
  • Fundacja Copernicus na rzecz Rozwoju Badań Naukowych
  • Instytut Historii im. Tadeusza Manteuffla Polskiej Akademii Nauk
  • Instytut Kultur Śródziemnomorskich i Orientalnych PAN
  • Instytut Tomistyczny
  • Karmelitański Instytut Duchowości w Krakowie
  • Ministerstwo Kultury i Dziedzictwa Narodowego
  • Państwowa Akademia Nauk Stosowanych w Krośnie
  • Państwowa Akademia Nauk Stosowanych we Włocławku
  • Państwowa Wyższa Szkoła Zawodowa im. Stanisława Pigonia w Krośnie
  • Polska Fundacja Przemysłu Kosmicznego
  • Polskie Towarzystwo Ekonomiczne
  • Polskie Towarzystwo Ludoznawcze
  • Towarzystwo Miłośników Torunia
  • Towarzystwo Naukowe w Toruniu
  • Uniwersytet im. Adama Mickiewicza w Poznaniu
  • Uniwersytet Komisji Edukacji Narodowej w Krakowie
  • Uniwersytet Mikołaja Kopernika
  • Uniwersytet w Białymstoku
  • Uniwersytet Warszawski
  • Wojewódzka Biblioteka Publiczna - Książnica Kopernikańska
  • Wyższe Seminarium Duchowne w Pelplinie / Wydawnictwo Diecezjalne „Bernardinum" w Pelplinie

© 2021- Nicolaus Copernicus University Accessibility statement Shop