Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

File(s)
90-1123.pdf (1.46 MB)
90-1123.ps (314.58 KB)
Permanent Link(s)
https://hdl.handle.net/1813/6963
Collections
Computer Science Technical Reports
Author
Kozen, Dexter
Abstract

We give a finite axiomatization of the algebra of regular events involving only universal Horn formulas. Unlike Salomaa's axiomatizations, ours is sound for all interpretations over Kleene algebras.

Date Issued
1990-05
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1123
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance