On the Complexity of the Equational Theory of Relational Action Algebras
From MaRDI portal
(Redirected from Publication:5459176)
Logic in computer science (03B70) Equational classes, universal algebra in model theory (03C05) Other algebras related to logic (03G25) Applications of universal algebra in computer science (08A70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)
Recommendations
Cited in
(17)- On computation complexity problems concerning relation algebras
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Decidability of equational theories for subsignatures of relation algebra
- Equational theories for automata
- Language models for some extensions of the Lambek calculus
- Relational models for the Lambek calculus with intersection and unit
- On Action Logic: Equational Theories of Action Algebras
- An infinitary sequent system for the equational theory of *-continuous action lattices
- scientific article; zbMATH DE number 549971 (Why is no real title available?)
- Complexity of the infinitary Lambek calculus with Kleene star
- Complexity of equational theory of relational algebras with standard projection elements
- Relational and Kleene-Algebraic Methods in Computer Science
- Relational Models for the Lambek Calculus with Intersection and Constants
- Equational properties of Kleene algebras of relations with conversion
- Finite relational semantics for language Kleene algebra with complement
- Complexity of equational theories for relational and language action lattices
- Infinitary action logic: complexity, models and grammars
This page was built for publication: On the Complexity of the Equational Theory of Relational Action Algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459176)
