Skip to main content
SpringerLink
Log in

Complete Categorical Equational Deduction

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2001)

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

Included in the following conference series:

Abstract

A categorical four-rule deduction system for equational logics is presented. We show that under reasonable finiteness requirements this system is complete with respect to equational satisfaction abstracted as injectivity. The generality of the presented framework allows one to derive conditional equations as well at no extra cost. In fact, our deduction system is also complete for conditional equations, a new result at the author’s knowledge.

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

Access this chapter

Log in via an institution
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. Hajnal Andréka and István Németi. A general axiomatizability theorem formulated in terms of cone-injective subcategories. In B. Csakany, E. Fried, and E.T. Schmidt, editors, Universal Algebra, pages 13–35. North-Holland, 1981. Colloquia Mathematics Societas János Bolyai, 29.

    Google Scholar 

  2. Bernhard Banaschewski and Horst Herrlich. Subcategories defined by implications. Houston Journal Mathematics, 2:149–171, 1976.

    MATH  MathSciNet  Google Scholar 

  3. Jan Bergstra and John Tucker. Characterization of computable data types by means of a finite equational specification method. In Jaco de Bakker and Jan van Leeuwen, editors, Automata, Languages and Programming, Seventh Colloquium, pages 76–90. Springer, 1980. Lecture Notes in Computer Science, Volume 81.

    Google Scholar 

  4. Garrett Birkhoff. On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society, 31:433–454, 1935.

    Article  MATH  Google Scholar 

  5. Manuel Clavel, Steven Eker, Patrick Lincoln, and José Meseguer. Principles of Maude. In José Meseguer, editor, Proceedings, First International Workshop on Rewriting Logic and its Applications. Elsevier Science, 1996. Volume 4, Electronic Notes in Theoretical Computer Science.

    Google Scholar 

  6. Virgil Căzănescu. Local equational logic. In Zoltan Esik, editor, Proceedings, 9th International Conference on Fundamentals of Computation Theory FCT’93, pages 162–170. Springer-Verlag, 1993. Lecture Notes in Computer Science, Volume 710.

    Google Scholar 

  7. Răzvan Diaconescu. Category-based Semantics for Equational and Constraint Logic Programming. PhD thesis, University of Oxford, 1994.

    Google Scholar 

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

    Google Scholar 

  9. Joseph Goguen, Kai Lin, and Grigore Roşu. Circular coinductive rewriting. In Proceedings, Automated Software Engineering’ 00, pages 123–131. IEEE, 2000. (Grenoble, France).

    Google Scholar 

  10. Joseph Goguen and Grant Malcolm. A hidden agenda. Theoretical Computer Science, 245(1):55–101, August 2000. Also UCSD Dept. Computer Science &Eng. Technical Report CS97-538, May 1997.

    Google Scholar 

  11. Joseph Goguen and José Meseguer. Completeness of many-sorted equational logic. Houston Journal of Mathematics, 11(3):307–334, 1985. Preliminary versions have appeared in: SIGPLAN Notices, July 1981, Volume 16, Number 7, pages 24–37; SRI Computer Science Lab, Report CSL-135, May 1982; and Report CSLI-84-15, Center for the Study of Language and Information, Stanford University, September 1984.

    MATH  MathSciNet  Google Scholar 

  12. Joseph Goguen and José Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105(2):217–273, 1992. Drafts exist from as early as 1985.

    Article  MATH  MathSciNet  Google Scholar 

  13. Joseph Goguen, Timothy Winkler, José Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Introducing OBJ. In Joseph Goguen and Grant Malcolm, editors, Software Engineering with OBJ: algebraic specification in action, pages 3–167. Kluwer, 2000.

    Google Scholar 

  14. Alexandre Grothendieck. Sur quelques points d’algébre homologique. Tôhoku Mathematical Journal, 2:119–221, 1957.

    MathSciNet  Google Scholar 

  15. Horst Herrlich and George Strecker. Category Theory. Allyn and Bacon, 1973.

    Google Scholar 

  16. J. R. Isbell. Subobjects, adequacy, completeness and categories of algebras. Rozprawy Matematyczne, 36:1–33, 1964.

    MathSciNet  Google Scholar 

  17. Joachim Lambek. Completions of Categories. Springer-Verlag, 1966. Lecture Notes in Mathematics, Volume 24.

    Google Scholar 

  18. Saunders Mac Lane. Categories for the Working Mathematician. Springer, 1971.

    Google Scholar 

  19. B. Mitchell. Theory of categories. Academic Press, New York, 1965.

    Book  MATH  Google Scholar 

  20. István Németi. On notions of factorization systems and their applications to cone-injective subcategories. Periodica Mathematica Hungarica, 13(3):229–335, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  21. István Németi and Ildickó Sain. Cone-implicational subcategories and some Birkhoff-type theorems. In B. Csakany, E. Fried, and E.T. Schmidt, editors, Universal Algebra, pages 535–578. North-Holland, 1981. Colloquia Mathematics Societas János Bolyai, 29.

    Google Scholar 

  22. Peter Padawitz and Martin Wirsing. Completeness of many-sorted equational logic revisited. Bulletin of the European Association for Theoretical Computer Science, 24:88–94, October 1984.

    Google Scholar 

  23. H. Reichel. Initial Computability, Algebraic Specifications, and Partial Algebras. Oxford University Press, 1987.

    Google Scholar 

  24. Grigore Roşu. Hidden Logic. PhD thesis, University of California at San Diego, 2000. http://ase.arc.nasa.gov/grosu/phd-thesis.ps.

  25. Grigore Roşu. Axiomatizability in inclusive equational logics. Mathematical Structures in Computer Science, to appear. http://ase.arc.nasa.gov/grosu/iel.ps.

  26. Grigore Roşu and Joseph Goguen. On equational Craig interpolation. Journal of Universal Computer Science, 6(1):194–200, 2000.

    MathSciNet  MATH  Google Scholar 

  27. Pieter Hendrik Rodenburg. A simple algebraic proof of the equational interpolation theorem. Algebra Universalis, 28:48–51, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  28. Gert Smolka, Werner Nutt, Joseph Goguen, and José Meseguer. Order-sorted equational computation. In Maurice Nivat and Hassan Aÿt-Kaci, editors, Resolution of Equations in Algebraic Structures, Volume 2: Rewriting Techniques, pages 299–367. Academic, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Advanced Computer Science Automated Software Engineering Group, NASA Ames Research Center, Moffett Field, California, 94035-1000, USA

    Grigore Roşu

Authors
  1. Grigore Roşu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LSV (Ecole Normale Supérieure de Cachan and CNRS), 61, Avenue du Président Wilson, 94230, Cachan, France

    Laurent Fribourg

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roşu, G. (2001). Complete Categorical Equational Deduction. In: Fribourg, L. (eds) Computer Science Logic. CSL 2001. Lecture Notes in Computer Science, vol 2142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44802-0_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-44802-0_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42554-0

  • Online ISBN: 978-3-540-44802-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation