Left-Handed Completeness for Kleene algebra, via Cyclic Proofs
From MaRDI portal
(Redirected from Publication:5222960)
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
Cited in
(14)- A cut-free cyclic proof system for Kleene algebra
- Left-handed completeness
- Left-handed completeness
- Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
- Completeness and the finite model property for Kleene algebra, reconsidered
- On tools for completeness of Kleene algebra with hypotheses
- Completeness theorems for Kleene algebra with tests and top
- An elementary proof of the FMP for Kleene algebra
- Herbrand schemes for cyclic proofs
- A proof theory of right-linear ( -)grammars via cyclic proofs
- An algebraic theory of nondeterministic finite automata
- A cyclic proof system for guarded Kleene algebra with tests
- A proof theory of ( -)context-free languages, via non-wellfounded proofs
- Algorithmic complexity of theories with Kleene iteration
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)
