Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computing and Information Science
  4. Computing and Information Science Technical Reports
  5. On the Complexity of the Horn Theory of REL

On the Complexity of the Horn Theory of REL

File(s)
TR2003-1896.ps (174.96 KB)
Permanent Link(s)
https://hdl.handle.net/1813/5612
Collections
Computing and Information Science Technical Reports
Author
Hardin, Chris
Kozen, Dexter
Abstract

We show that the universal Horn theory of relational Kleene algebras is Pi-1-1-complete.

Date Issued
2003-05-08
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2003-1896
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

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