Left-Handed Completeness for Kleene algebra, via Cyclic Proofs

DOI10.29007/HZQ3zbMath1415.68124OpenAlexW2907293811MaRDI QIDQ5222960

Anupam Das, Amina Doumane, Damien Pous

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.29007/hzq3

zbMATH Keywords

automatainductionregular languagesaxiomatisationKleene algebracyclic proofs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70)

Related Items (4)

Completeness and the finite model property for Kleene algebra, reconsidered ⋮ Left-handed completeness ⋮ Completeness theorems for Kleene algebra with tests and top ⋮ On tools for completeness of Kleene algebra with hypotheses

This page was built for publication: Left-Handed Completeness for Kleene algebra, via Cyclic Proofs