Normal forms for binary relations

DOI10.1016/j.tcs.2006.03.023zbMath1097.03059OpenAlexW2166528689MaRDI QIDQ2503327

Claudio Gutierrez, Daniel J. Dougherty

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.023

zbMATH Keywords

normal formsbinary relationsgraph representationomitting minors

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (2)

A graphical representation of relational formulae with complementation ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• Proof theory for linear lattices
• A relational theory of computing
• The origin of relation algebras in the development and axiomatization of the calculus of relations
• Formal program development. IFIP TC2/WG 2.1 State-of-the-Art report
• Relation-algebraic semantics
• The equational theory of union-free algebras of relations
• Equational theory of relation algebras with positive operations
• Proofs with graphs
• Relational matching for graphical calculi of relations
• Topology of series-parallel networks
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Relational Methods in Computer Science
• Arguesian lattices which are not linear
• An axiomatic basis for computer programming
• A Combinatorial Model for Series-Parallel Networks
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Normal forms for connectedness in categories

This page was built for publication: Normal forms for binary relations