On kleene algebras and closed semirings

Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)


Kleene algebras are an important class of algebraic structures that arise in diverse areas of computer science: program logic and semantics, relational algebra, automata theory, and the design and analysis of algorithms. The literature contains at several inequivalent definitions of Kleene algebras and related algebraic structures [2,13,14,5,6,1,9,7].

In this paper we establish some new relationships among these structures. Our main results are:
  • •There is a Kleene algebra in the sense of [6] that is not *-continuous.

  • •The categories of *-continuous Kleene algebras [5,6], closed semirings [1,9] and S-algebras [2] are strongly related by adjunctions.

  • •The axioms of Kleene algebra in the sense of [6] are not complete for the universal Horn theory of the regular events. This refutes a conjecture of Conway [2, p. 103].

  • •Right-handed Kleene algebras are not necessarily left-handed Kleene algebras. This verifies a weaker version of a conjecture of Pratt [14].


Transitive Closure Dynamic Logic Left Adjoint Forgetful Functor Multiplicative Identity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975.Google Scholar
  2. [2]
    John Horton Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.Google Scholar
  3. [3]
    John Horton Conway, personal communication, May 1990.Google Scholar
  4. [4]
    Harel, D., First-Order Dynamic Logic. Lecture Notes in Computer Science 68, Springer-Verlag, 1979.Google Scholar
  5. [5]
    Dexter Kozen, “On induction vs. *-continuity,” Proc. Workshop on Logics of Programs 1981, Spring-Verlag Lect. Notes in Comput. Sci. 131, ed. Kozen, 1981, 167–176.Google Scholar
  6. [6]
    Dexter Kozen, “A completeness theorem for Kleene algebras and the algebra of regular events,” Cornell TR90-1123, May 1990.Google Scholar
  7. [7]
    Werner Kuich, “The Kleene and Parikh Theorem in Complete Semirings,” in: Proc. 14th Colloq. Automata, Languages, and Programming, ed. Ottmann, Springer-Verlag Lecture Notes in Computer Science 267, 1987, 212–225.Google Scholar
  8. [8]
    Saunders Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.Google Scholar
  9. [9]
    Kurt Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1984.Google Scholar
  10. [10]
    K. C. Ng and A. Tarski, “Relation algebras with transitive closure,” Abstract 742-02-09, Notices Amer. Math. Soc. 24 (1977), A29–A30.Google Scholar
  11. [11]
    K. C. Ng. Relation Algebras with Transitive Closure. PhD Thesis, University of California, Berkeley, 1984.Google Scholar
  12. [12]
    Vaughan Pratt, “Semantical Considerations on Floyd-Hoare Logic,” Proc. 17th IEEE Symp. Found. Comput. Sci. 1976, 109–121.Google Scholar
  13. [13]
    Vaughan Pratt, “Dynamic algebras and the nature of induction,” Proc. 12th ACM Symp. on Theory of Computing, 1980, 22–28.Google Scholar
  14. [14]
    Vaughan Pratt, “Dynamic algebras as a well-behaved fragment of relation algebras,” in: D. Pigozzi, ed., Proc. Conf. on Algebra and Computer Science, Ames, Iowa, June 2–4, 1988; Spring-Verlag Lecture Notes in Computer Science, to appear.Google Scholar
  15. [15]
    Arto Salomaa, “Two complete axiom systems for the algebra of regular events,” J. Assoc. Comput. Mach. 13:1 (January, 1966), 158–169.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations