Skip to main content

Axiomatization of the coherence property for categories of symmetries

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1999)

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

Included in the following conference series:

  • 378 Accesses

Abstract

Given an equational theory (Σ, E), a relaxed (Σ, E)-system is a category S enriched with a Σ-algebra structure on both objects and arrows such that a natural isomorphism σ StS), called natural symmetry, exists for each t = E t′. A symmetry is an instance of a natural symmetry. A category of symmetries, which includes only symmetries, is a free object in the category of relaxed (Σ, E)-systems. The coherence property states that the diagrams in a category of symmetries are commutative. In this paper we present a method for expressing the coherence property in an axiomatic way.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. V.E. Căzănescu and Gh. Ştefănescu. Classes of finite relations as initial abstract data types I. Discrete Mathematics, 90:233–265, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  2. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science. Elsevier Science, 1990.

    Google Scholar 

  3. Răzvan Diaconescu and Kokichi Futatsugi. CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification, volume 6 of AMAST Series in Computing. World Scientific, 1998.

    Google Scholar 

  4. D. Lucanu. On the axiomatization of the category of symmetries. Technical report TR-98-03, University “Al.I.Cuza” of Iaşi, Computer Science Department, December 1998. http://www.infoiasi.ro/~dlucanu/reports.html.

  5. D. Lucanu. Relaxed models for concurrent rewriting logic. Internal report, University “Al.I.Cuza” of Iaşi, Computer Science Department, November 1998. URL: http://www.infoiasi.ro/~dlucanu/.

  6. S. MacLane. Category theory for working mathematician. Springer Verlag Berlin, 1971.

    Google Scholar 

  7. J. Meseguer. Conditional rewriting logic as unified model of concurrency. Theoretical Computer Science, 96:73–155, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Meseguer. A logical theory of concurrent objects and its realization in the Maude language. In Gul Agha, Peter Wegner, and Akinori Yonezawa, editors, Research Directions in Concurrent Object-Oriented Programming. The MIT Press, 1993.

    Google Scholar 

  9. V. Sassone. On the category of Petri net computation. In TAPSOFT’95, LNCS, pages 334–348. Springer Verlag, 1995.

    Google Scholar 

  10. V. Sassone. An axiomatization of the algebra of Petri net concatenable processes. to appear in Theoretical Computer Science, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lucanu, D. (1999). Axiomatization of the coherence property for categories of symmetries. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-48321-7_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66412-3

  • Online ISBN: 978-3-540-48321-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics