Skip to main content

Compositional Homomorphisms of Relational Structures

Modeled as Multialgebras

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2138))

Abstract

The paper attempts a systematic study of homomorphisms of relational structures. Such structures are modeled as multialgebras (i.e., relation is represented as a set-valued function). The first, main, result is that, under reasonable restrictions on the form of the definition of homomorphism, there are exactly nine compositional homomorphisms of multialgebras. Then the comparison of the obtained categories with respect to the existence of finite limits and co-limits reveals two of them to be finitely complete and co-complete. Without claiming that compositionality and categorical properties are the only possible criteria for selecting a definition of homomorphism, we nevertheless suggest that, for many purposes, these criteria actually might be acceptable. For such cases, the paper gives an overview of the available alternatives and a clear indication of their advantages and disadvantages.

The first author gratefully acknowledges the financial support from the Norwegian Research Council.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bandler, W. AND Kohout, L. J. On new types of homomorphisms and congruences for partial algebras and n-ary relations. Int. J. General Systems 12, 149–157. (1986).

    Article  MATH  MathSciNet  Google Scholar 

  2. Bandler, W. AND Kohout, L. J. On the general theory of relational morphisms. Int. J. General Systems 13, 47–66. (1986).

    Article  MathSciNet  Google Scholar 

  3. Boyd, J. P. Relational homomorphisms. Social Networks 14, 163–186. (1992).

    Article  MathSciNet  Google Scholar 

  4. Brink, C. Power structures. Algebra Universalis 30, 177–216. (1993).

    Article  MATH  MathSciNet  Google Scholar 

  5. Brink, C., Jacobs, D., Netle, K., AND Sekran, R. Generalized quotient algebras and power algebras. (1997), [unpublished].

    Google Scholar 

  6. Burmeister, P.A Model Theoretic Oriented Approach to Partial Algebras. Akademie-Verlag, Berlin. (1986).

    MATH  Google Scholar 

  7. Cohn, P. M.Universal Algebra. D. Reidel Publishing Company. (1981), [series “Mathematics and Its Applications”, vol. 6].

    Google Scholar 

  8. Glenn, P. Identification of certain structures as split opfibrations over δop. (1997), [to appear in Journal of Pure and Applied Algebra].

    Google Scholar 

  9. Gratzer, G.Universal Algebra. Springer. (1968).

    Google Scholar 

  10. Hansoul, G. A subdirect decomposition theorem for multialgebras. Algebra Universalis 16. (1983).

    Google Scholar 

  11. Hodzic, A. Categories of multialgebras. Technical report, M.Sc. Thesis at University of Bergen, Dept. of Informatics. (2001), [forthcoming].

    Google Scholar 

  12. Hussmann, H.Nondeterministic algebraic specifications. Ph. D. thesis, Fak. f. Mathematik und Informatik, Universitat Passau. (1990).

    Google Scholar 

  13. Hussmann, H.Nondeterminism in Algebraic Specifications and Algebraic Programs. Birkhäuser. (1993), [revised version of [12]].

    Google Scholar 

  14. Jónsson, B. Varieties of relation algebras. Algebra Universalis 15, 273–298. (1982).

    Article  MATH  MathSciNet  Google Scholar 

  15. Jónsson, B. AND Tarski, A. Boolean algebras with Operators i. American J. Mathematics 73, 891–939. (1951).

    Article  MATH  Google Scholar 

  16. Jónsson, B. AND Tarski, A. Boolean algebras with operators ii. American J. Mathematics 74, 127–162. (1952).

    Article  MATH  Google Scholar 

  17. Kapur, D.Towards a Theory of Abstract Data Types. Ph. D. thesis, Laboratory for CS, MIT. (1980).

    Google Scholar 

  18. Konikowska, B. AND Blaklaslk, M. Reasoning with nondeterministic specifications. Acta Informatica 36,5, 375–403. (1999).

    Article  MATH  MathSciNet  Google Scholar 

  19. Kriaučiukas, V. AND Walicki, M.Reasoning and rewriting with set-relations II: the non-ground case. LNCS vol. 1130, Springer. (1996).

    Google Scholar 

  20. Kloś, J. Homomorphisms of relations. (1985), [manuscript, Warszawa].

    Google Scholar 

  21. Madarász, R. Remarks on power structures. Algebra Universalis 34,2, 179–184. (1995).

    Article  MATH  MathSciNet  Google Scholar 

  22. Mostowski, A.Mathematical Logic. Warszawa-WrocHlaw. (1948), [in Polish].

    Google Scholar 

  23. Nipkow, T. Non-deterministic data types: models and implementations. Acta Informatica 22, 629–661. (1986).

    Article  MATH  MathSciNet  Google Scholar 

  24. Nipkow, T.Observing non-deterministic data types. LNCS vol. 332, Springer. (1987).

    Google Scholar 

  25. Pattison, P. The analysis of semigroups of multirelational systems. J. Mathematical Psychology 25, 87–117. (1982).

    Article  MATH  MathSciNet  Google Scholar 

  26. Pickert, G. Bemerkungen zum homomorphie-begriff. Mathematische Zeitschrift 53. (1950).

    Google Scholar 

  27. Pickett, H. Homomorphisms and subalgebras of multialgebras. Pacific J. of Mathematics 21, 327–342. (1967).

    MATH  MathSciNet  Google Scholar 

  28. Topentcharov, V. V. Composition générale des relations. Algebra Universalis 30, 119–139. (1993).

    Article  MATH  MathSciNet  Google Scholar 

  29. Walicki, M. AND Biaklsik, M. Relations, multialgebras and homomorphisms. Technical Report 838, Institute of Computer Science, Polish Academy of Sciences. (1997).

    Google Scholar 

  30. Walicki, M. AND Biaklsik, M. (some) categories of relational structures. Recent Trends in ADT, LNCS 1376. (1997).

    Google Scholar 

  31. Walicki, M. AND Meldal, S. A complete calculus for the multialgebraic and functional semantics of nondeterminism. ACM ToPLaS 17, 2. (1995).

    Article  Google Scholar 

  32. Walicki, M. AND Meldal, S.Multialgebras, power algebras and complete calculi of identities and inclusions. LNCS vol. 906, Springer. (1995).

    Google Scholar 

  33. Walicki, M. AND Meldal, S. Algebraic approaches to nondeterminism-an overview. ACM Computing Surveys 29, 1 (March). (1997).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walicki, M., Hodzic, A., Meldal, S. (2001). Compositional Homomorphisms of Relational Structures. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics