Left-Handed Completeness for Kleene algebra, via Cyclic Proofs

DOI10.29007/HZQ3zbMATH Open1415.68124OpenAlexW2907293811MaRDI QIDQ5222960FDOQ5222960

Authors: 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

Recommendations

• A completeness theorem for nondeterministic Kleene algebras
• A cut-free cyclic proof system for Kleene algebra
• On tools for completeness of Kleene algebra with hypotheses
• Affine completeness of Kleene algebras
• Completeness and incompleteness of synchronous Kleene algebra
• scientific article; zbMATH DE number 1086671
• Completeness and the finite model property for Kleene algebra, reconsidered
• Completeness and incompleteness in nominal Kleene algebra
• Completeness and incompleteness in nominal Kleene algebra
• A completeness theorem for Kleene algebras and the algebra of regular events

zbMATH Keywords

automatainductionregular languagesKleene algebraaxiomatisationcyclic proofs

Mathematics Subject Classification ID

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

Cited In (6)

• On tools for completeness of Kleene algebra with hypotheses
• Left-handed completeness
• Completeness theorems for Kleene algebra with tests and top
• Completeness and the finite model property for Kleene algebra, reconsidered
• Left-handed completeness
• A cut-free cyclic proof system for Kleene algebra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222960)