On the complexity of Kleene algebra with domain
From MaRDI portal
(Redirected from On the complexity of Kleene algebra with domain)
Cites work
- A completeness theorem for Kleene algebras and the algebra of regular events
- Algebras of modal operators and partial correctness
- An elementary proof of the completeness of PDL
- Axiomatizability of representable domain algebras
- Building program construction and verification tools from algebraic principles
- Dynamic algebras with test
- Dynamic algebras: Examples, constructions, applications
- Dynamic predicate logic
- Free Kleene algebras with domain
- scientific article; zbMATH DE number 4210141 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3704559 (Why is no real title available?)
- scientific article; zbMATH DE number 58315 (Why is no real title available?)
- scientific article; zbMATH DE number 1223627 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- Internal axioms for domain semirings
- Kleene algebra with domain
- Modal Semirings Revisited
- On the expressive power of Kleene algebra with domain
- Propositional dynamic logic of regular programs
Cited in
(8)- On the complexity of reasoning in Kleene algebra
- A Quest for Kleene Algebra in 2 Dimensions
- Kleene algebra with domain
- Kleene algebra of weighted programs with domain
- Implicational Kleene algebra with domain and the substructural logic of partial correctness
- Domain reasoning in TopKAT
- A complete propositional dynamic logic for regular expressions with lookahead
- On the expressive power of Kleene algebra with domain
This page was built for publication: On the complexity of Kleene algebra with domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174424)
