JavaScript is disabled for your browser. Some features of this site may not work without it.
On Kleene Algebras and Closed Semirings
dc.contributor.author | Kozen, Dexter | en_US |
dc.date.accessioned | 2007-04-23T17:47:55Z | |
dc.date.available | 2007-04-23T17:47:55Z | |
dc.date.issued | 1990-05 | en_US |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1131 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/6971 | |
dc.description.abstract | 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: (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.extent | 150652 bytes | |
dc.format.extent | 296332 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.language.iso | en_US | en_US |
dc.publisher | Cornell University | en_US |
dc.subject | computer science | en_US |
dc.subject | technical report | en_US |
dc.title | On Kleene Algebras and Closed Semirings | en_US |
dc.type | technical report | en_US |