Expressive Power and Succinctness of the Positive Calculus of Relations
From MaRDI portal
Publication:5098722
DOI10.1007/978-3-030-43520-2_13OpenAlexW3014025647MaRDI QIDQ5098722FDOQ5098722
Authors: Yoshiki Nakamura 
Publication date: 30 August 2022
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-43520-2_13
Recommendations
Cites Work
- Title not available (Why is that?)
- Cylindric algebras. Part II
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- Title not available (Why is that?)
- On the calculus of relations
- Elements of finite model theory.
- Title not available (Why is that?)
- Relation algebras
- The equational theory of union-free algebras of relations
- Title not available (Why is that?)
- Title not available (Why is that?)
- The succinctness of first-order logic on linear orders
- On the complexity of existential positive queries
- Structure and complexity of relational queries
- The calculus of relations as a foundation for mathematics
- Introduction to Relation Algebras
- The undecidability of FO3 and the calculus of relations with just one binary relation
- On the positive calculus of relations with transitive closure
- Partial derivatives on graphs for Kleene allegories
- Allegories: decidability and graph homomorphisms
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)
