Skip Navigation


Journal of Logic and Computation Advance Access originally published online on December 12, 2008
Journal of Logic and Computation 2009 19(2):305-321; doi:10.1093/logcom/exn099
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mikulás, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Corner Article

Algebras of Relations and Relevance Logic

Szabolcs Mikulás

School of Computer Science and Information Systems, Birkbeck College, University of London, Malet Street, London WC1E 7HX, UK.
E-mail: szabolcs{at}dcs.bbk.ac.uk

Received 6 May 2008.

We prove that algebras of binary relations whose similarity type includes intersection, composition, converse negation and the identity constant form a non-finitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of relevant logic with respect to binary relations.

Keywords: relevance logic; completeness; De Morgan monoids; relation algebras; finite axiomatizability

This article is dedicated to the memory of Professor Imre Ruzsa (1921–2008)



References

  1. Anderson AR, Belnap ND, Dunn JM. Entailment. The Logic of Relevance and Necessity (1992) II. Princeton University Press.
  2. Andréka H. Representation of distributive lattice-ordered semigroups with binary relations. Algebra Universalis (1991) 28:12–25.[CrossRef][Web of Science]
  3. Anderson AR, Belnap ND. Entailment. The Logic of Relevance and Necessity (1975) I. Princeton University Press.
  4. Andréka H, Mikulás Sz. Lambek calculus and its relational semantics: completeness and incompleteness. Journal of Logic, Language and Information (1994) 3:1–37.[CrossRef]
  5. Dunn JM. The Algebra of Intensional Logics (1966) University of Pittsburgh. PhD dissertation.
  6. Dunn JM. Relational representation of quasi-boolean algebras. Notre Dame Journal of Formal Logic (1982) 23:353–357.[CrossRef]
  7. Dunn JM. Non-commutative linear logic. (1992) (Last accessed on 26 November 2008). Available at http://www.seas.upenn.edu/~sweirich/types/archive/1992/msg00028.html.
  8. Dunn JM. A representation of relation algebras using Routley–Meyer frames. In: Logic, Meaning and Computation—Anderson CA, Zelëny M, eds. (2001) Kluwer. 77–108.
  9. Font JM, Rodriguez G. Note on algebraic models for relevance logic. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (1990) 36:535–540.[CrossRef][Web of Science]
  10. Font JM, Rodriguez G. Algebraic study of two deductive systems of relevance logic. Notre Dame Journal of Formal Logic (1994) 35:369–397.[CrossRef]
  11. Hirsch R, Hodkinson I. Relation Algebras by Games (2002) North-Holland.
  12. Hodges W. Model Theory (1993) Cambridge University Press.
  13. Hodkinson I, Mikulás Sz. Axiomatizability of reducts of algebras of relations. Algebra Universalis (2000) 43:127–156.[CrossRef][Web of Science]
  14. Kowalski T. Weakly associative relation algebras hold the key to the universe. Bulletin of the Section of Logic (2007) 36:145–157.
  15. Maddux RD. A sequent calculus for relation algebras. Annals of Pure and Applied Logics (1983) 25:73–101.[CrossRef]
  16. Maddux RD. Relevance logic and the calculus of relations. (2007) (Last accessed on 26 November 2008). Department of Mathematics, Vanderbilt University. International Conference on Order, Algebra and LogicsAbstract available at http://www.math.vanderbilt.edu/~oal2007/submissions/submission_10.pdf. More detailed notes available at http://www.math.iastate.edu/maddux/talk.pdf (Last accessed on 26 November 2008).
  17. Meyer RK, Routley R. Classical relevant logics II. Studia Logica (1974) 33:183–194.[CrossRef]
  18. Routley R, Meyer RK. The semantics of entailment (I). In: Truth, Syntax and Modality—Leblanc H, ed. (1973) North-Holland. 199–243.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mikulás, S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?