Stone relation algebras

DOI10.1007/978-3-319-57418-9_8MaRDI QIDQ5283207zbMATH OpenOpenAlexFDO

Authors Walter Guttmann

Publication date 21 July 2017

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-319-57418-9_8

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Cylindric and polyadic algebras; relation algebras (03G15)

Recommendations

• Verifying minimum spanning tree algorithms with Stone relation algebras
• Relational characterisations of paths
• A Stone Type Representation Theorem for Algebras of Relations of Higher Rank
• On a Graph Calculus for Algebras of Relations
• Lattice-Based Relation Algebras II

Cites work

• scientific article; zbMATH DE number 3912440 (Why is no real title available?)
• scientific article; zbMATH DE number 194258 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3614740 (Why is no real title available?)
• scientific article; zbMATH DE number 1210360 (Why is no real title available?)
• scientific article; zbMATH DE number 475188 (Why is no real title available?)
• scientific article; zbMATH DE number 977284 (Why is no real title available?)
• scientific article; zbMATH DE number 1086633 (Why is no real title available?)
• scientific article; zbMATH DE number 1086671 (Why is no real title available?)
• scientific article; zbMATH DE number 927100 (Why is no real title available?)
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• scientific article; zbMATH DE number 3366941 (Why is no real title available?)
• A completeness theorem for Kleene algebras and the algebra of regular events
• A linear algebra approach to OLAP
• A new algebraic approach to L-fuzzy relations convenient to study crispness
• Algebras for iteration and infinite computations
• Axiomatizability of positive algebras of binary relations
• Categorical representation theorems of fuzzy relations
• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Computing tournament solutions using relation algebra and RelView
• Crispness in Dedekind categories
• Dijkstra, Floyd and Warshall meet Kleene
• Extending Sledgehammer with SMT solvers
• Graphs, dioids and semirings. New models and algorithms.
• Internal axioms for domain semirings
• Isabelle/HOL. A proof assistant for higher-order logic
• L-fuzzy sets
• Lattices and ordered algebraic structures
• Nitpick: a counterexample generator for higher-order logic based on a relational model finder
• Program analysis and verification based on Kleene algebra in Isabelle/HOL
• Regular Algebra Applied to Path-finding Problems
• Relation algebras
• Relation algebras by games
• Relation-algebraic semantics
• Relation-algebraic verification of Prim's minimum spanning tree algorithm
• Relational style laws and constructs of linear algebra
• Relations among matrices over a semiring
• Representations of ordered semigroups and lattices by binary relations
• Stone relation algebras

Cited in

(6)

• An algebraic framework for minimum spanning tree problems
• Hopscotch -- reaching the target hop by hop
• Relational characterisations of paths
• Stone Algebras
• Stone relation algebras
• Verifying minimum spanning tree algorithms with Stone relation algebras

Describes a project that uses

Uses Software

• Isabelle
• Nitpick
• RelView
• Isabelle/HOL
• HOL
• Sledgehammer
• Archive Formal Proofs
• Relation Algebra
• Kleene Algebra

This page was built for publication: Stone relation algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283207)