Skip to main content
SpringerLink
Log in

Weakly Associative Relation Algebras with Polyadic Composition Operations

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

In this paper we introduced various classes of weakly associative relation algebras with polyadic composition operations. Among them is the class RWA∞ of representable weakly associative relation algebras with polyadic composition operations. Algebras of this class are relativized representable relation algebras augmented with an infinite set of operations of increasing arity which are generalizations of the binary relative composition. We show that RWA∞ is a canonical variety whose equational theory is decidable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. AndrÉka, Á, Kurucz, I. NÉmeti, I. Sain and A. Simon, ‘Exactly which logics touched by the dynamic trend are decidable?’, Proceedings of the 9th Amsterdam Colloquium, ILLC, University of Amsterdam, 1994, p. 67-86.

  2. H. AndrÉka, J.D. Monk and I. NÉmeti (eds.), Algebraic Logic; Proceedings of the 1988 Budapest Conference on Algebraic Logic, North-Holland, Amsterdam, 1991.

    Google Scholar 

  3. L. Csirmaz, D. Gabbay and M. de Rijke (eds.), Logic Colloquium '92, CSLI Publications & FoLLI, 1995.

  4. R. Goldblatt, ‘Varieties of complex algebras’, Annals of Pure and Applied Logic 44 (1989), 173-242.

    Google Scholar 

  5. R. Hirsch and I. Hodkinson, ‘Step by step — building representations in algebraic logic’, Journal of Symbolic Logic 62 (1997), 225-279.

    Google Scholar 

  6. B. JÓnsson, ‘The theory of binary relations’, in [Andréka, Monk & Németi 1991], p. 245-292.

  7. B. JÓnsson, ‘On the canonicity of Sahlqvist identities’, Studia Logica 53 (1994), 473-491.

    Google Scholar 

  8. B. JÓnsson and A. Tarski, ‘Boolean algebras with operators. Part 1’, American Journal of Mathematics 73 (1951), 891-939.

    Google Scholar 

  9. R. Maddux, ‘Some varieties containing relation algebra’, Transactions of the American Mathematical Society 272 (1982), 501-526.

    Google Scholar 

  10. M. Marx and Y. Venema, Multidimensional Modal Logic, Kluwer Academic Press, 1997.

  11. Sz. MikulÁs, Taming Logics, Doctoral dissertation, ILLC dissertations series 1995-12, University of Amsterdam.

  12. I. NÉmeti, ‘Decidability of relation algebras with weakened associativity’, Proc. AMS 100 (1987), 340-344.

    Google Scholar 

  13. I. NÉmeti, ‘Decidable versions of first order logic and cylindric-relativized set algebras’, in [Csirmaz, Gabbay & de Rijke 1995], p. 47-70.

  14. M. de Rijke and Y. Venema, ‘Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras’, Studia Logica 54 (1995), 61-78.

    Google Scholar 

  15. V. Stebletsova, ‘Weakly associative relation algebras with polyadic composition operations’, Technical Report 169, Department of Philosophy, Utrecht University, 1996.

  16. A. Tarski and S. Givant, A Formalization of Set Theory Without Variables, AMS Colloquium Publications, 41 (1987).

Download references

Author information

Authors and Affiliations

  1. Division of Mathematics and Computer Science Department of AI, Vrije Universiteit, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Vera Stebletsova

Authors
  1. Vera Stebletsova
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stebletsova, V. Weakly Associative Relation Algebras with Polyadic Composition Operations. Studia Logica 66, 297–323 (2000). https://doi.org/10.1023/A:1005204532371

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005204532371

Search

Navigation