Expressive Power and Succinctness of the Positive Calculus of Relations
From MaRDI portal
Publication:5098722
Recommendations
Cites work
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 2201362 (Why is no real title available?)
- Allegories: decidability and graph homomorphisms
- Cylindric algebras. Part II
- Elements of finite model theory.
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- Introduction to Relation Algebras
- On the calculus of relations
- On the complexity of existential positive queries
- On the positive calculus of relations with transitive closure
- Partial derivatives on graphs for Kleene allegories
- Relation algebras
- Structure and complexity of relational queries
- The calculus of relations as a foundation for mathematics
- The equational theory of union-free algebras of relations
- The succinctness of first-order logic on linear orders
- The undecidability of FO3 and the calculus of relations with just one binary relation
Cited in
(2)
This page was built for publication: Expressive Power and Succinctness of the Positive Calculus of Relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5098722)