Completeness for Identity-free Kleene Lattices - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Completeness for Identity-free Kleene Lattices

Abstract

We provide a finite set of axioms for identity-free Kleene lattices, which we prove sound and complete for the equational theory of their relational models. Our proof builds on the completeness theorem for Kleene algebra, and on a novel automata construction that makes it possible to extract axiomatic proofs using a Kleene-like algorithm.
Fichier principal
Vignette du fichier
KLm.pdf (626.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01780845 , version 1 (28-04-2018)
hal-01780845 , version 2 (02-07-2018)

Identifiers

Cite

Amina Doumane, Damien Pous. Completeness for Identity-free Kleene Lattices. CONCUR, Sep 2018, Beijing, China. ⟨10.4230/LIPIcs.CONCUR.2018.18⟩. ⟨hal-01780845v2⟩
141 View
152 Download

Altmetric

Share

Gmail Facebook X LinkedIn More