Positive Fork Graph Calculus

DOI10.1007/978-3-540-92687-0_11zbMath1211.03097OpenAlexW1531971469MaRDI QIDQ3605526

Sheila R. M. Veloso, Petrucio Viana, Paulo A. S. Veloso, Renata P. de Freitas

Publication date: 24 February 2009

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92687-0_11

zbMATH Keywords

completenessdecidabilitygraph calculusfork algebraspositive relational calculi

Mathematics Subject Classification ID

Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (1)

Set Venn diagrams applied to inclusions and non-inclusions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relation algebras by games
• Relation algebras
• Relation-algebraic semantics
• Proofs with graphs
• Relational matching for graphical calculi of relations
• Relational treatment of term graphs with bound variables
• Reasoning with Graphs
• On Positive Relational Calculi

This page was built for publication: Positive Fork Graph Calculus