Show simple item record

dc.contributor.authorKozen, Dexteren_US
dc.date.accessioned2007-04-23T17:47:55Z
dc.date.available2007-04-23T17:47:55Z
dc.date.issued1990-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1131en_US
dc.identifier.urihttps://hdl.handle.net/1813/6971
dc.description.abstractKleene 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: (1) There is a Kleene algebra in the sense of [6] that is not *-continuous. (2) The categories of *-continuous Kleene algebras [5, 6], closed semirings [1, 9] and S-algebras [2] are strongly related by adjunctions. (3) 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]. (4) Right-handed Kleene algebras are not necessarily left-handed Kleene algebras. This verifies a weaker version of a conjecture of Pratt [14].en_US
dc.format.extent150652 bytes
dc.format.extent296332 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOn Kleene Algebras and Closed Semiringsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics