Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4342))

Abstract

We present classes of algebras which may be viewed as weak relation algebras, where a Boolean part is replaced by a not necessarily distributive lattice. For each of the classes considered in the paper we prove a relational representation theorem.

This work was carried out in the framework of the European Commission’s COST Action 274 Theory and Applications of Relational Structures as Knowledge Instruments (TARSKI).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allwein, G., Dunn, J.M.: Kripke models for linear logic. J. Symb. Logic 58, 514–545 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Blount, K., Tsinaksis, C.: The structure of residuated lattices. Int. J. of Algebra Comput. 13(4), 437–461 (2003)

    Article  MATH  Google Scholar 

  3. Demri, S., Orłowska, E.: Incomplete Information: Structure, Inference, Complexity. In: EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2002)

    Google Scholar 

  4. Dunn, J.M.: Gaggle theory: an abstraction of Galois connections and residuation, with application to nagation, implication and various logical operators. LNCS (LNAI), vol. 478. 31–51, Heidelberg (2001)

    Google Scholar 

  5. Düntsch, I. (1994). Rough relation algebras. Fundamenta Informaticae 21, 321–331.

    MATH  MathSciNet  Google Scholar 

  6. Düntsch, I., Orłowska, E.: Beyond modalities: sufficiency and mixed algebras. In: Orłowska, E., Szałas, A. (eds.) Relational Methods for Computer Science Applications, pp. 263–285. Physica, Heidelberg (2001)

    Google Scholar 

  7. Düntsch, I., Orłowska, E.: Boolean algebras arising from information systems. In: Adamowicz, Z., Artemov, S., Niwiński, D., Orłowska, E., Romanowska, A., Woleński, J. (eds.) Annals of Pure and Applied Logic, Provinces of Logic Determined, Essays in the memory of Alfred Tarski. Special issue, vol. 127(1–3), pp. 77–98 (2004)

    Google Scholar 

  8. Düntsch, I., Orłowska, E., Radzikowska, A.M.: Lattice–based relation algebras and their representability. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 234–258. Springer, Heidelberg (2003)

    Google Scholar 

  9. Düntsch, I., Winter, M.: Rough relation algebras revisited. Fundamenta Informaticae (to appear, 2006)

    Google Scholar 

  10. Gehrke, M., Jónsson, B.: Bounded distributive lattices with operators. Mathematica Japonica 40(2), 207–215 (1994)

    MATH  MathSciNet  Google Scholar 

  11. Hart, J.B., Rafter, L., Tsinaksis, C.: The structure of commutative residuated lattices. Internat. J. Algebra Comput. 12(4), 509–524 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Jipsen, P., Tsinaksis, C.: A Survey of Residuated Lattices. In: Martinez, J. (ed.) Ordered algebraic structures, pp. 19–56. Kluwer Academic Publishers, Dordrecht (2003)

    Google Scholar 

  13. Jónsson, B., Tarski, A.: Boolean algebras with operators. Part I. American Journal of Mathematics 73, 891–936 (1951)

    Article  MATH  Google Scholar 

  14. Orłowska, E.: Information algebras. In: GIS 1992. LNCS, vol. 639, pp. 50–65. Springer, Heidelberg (1995)

    Google Scholar 

  15. Orłowska, E., Radzikowska, A.M.: Information relations and opeators based on double residuated lattices. In: Proceedings of the 6th International Workshop on Relational Methods in Computer Science RelMiCS 2001, pp. 185–199 (2001)

    Google Scholar 

  16. Orłowska, E., Radzikowska, A.M.: Double residuated lattices and their applications. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 171–189. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Orłowska, E., Vakarelov, D.: Lattice-based modal algebras and modal logics. In: Hajek, P., Valdés–Villanueva, L.M., Westerstahl, D. (eds.) Logic, Methodology and Philosophy of Science. Proceedings of the 12th International Congress, pp. 147–170. King’s College London Publications (2005)

    Google Scholar 

  18. Sofronie-Stokkermans, V.: Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics. Studia Logica 64 Part I, 93–122, Part II, 151–172 (2000)

    Google Scholar 

  19. Urquhart, A.: A topological representation theorem for lattices. Algebra Universalis 8, 45–58 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Düntsch, I., Orłowska, E., Radzikowska, A.M. (2006). Lattice-Based Relation Algebras II. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds) Theory and Applications of Relational Structures as Knowledge Instruments II. Lecture Notes in Computer Science(), vol 4342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11964810_13

Download citation

  • DOI: https://doi.org/10.1007/11964810_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69223-2

  • Online ISBN: 978-3-540-69224-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics