Stone relation algebras

DOI10.1007/978-3-319-57418-9_8zbMATH Open1402.03099OpenAlexW2592285783MaRDI QIDQ5283207FDOQ5283207

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

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

Mathematics Subject Classification ID

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

Cites Work

• Extending Sledgehammer with SMT Solvers
• Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
• Stone Relation Algebras
• Title not available (Why is that?)
• Relation-algebraic semantics
• Isabelle/HOL. A proof assistant for higher-order logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lattices and ordered algebraic structures
• Graphs, dioids and semirings. New models and algorithms.
• L-fuzzy sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Relation algebras
• A completeness theorem for Kleene algebras and the algebra of regular events
• A linear algebra approach to OLAP
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Internal axioms for domain semirings
• Relation algebras by games
• Algebras for iteration and infinite computations
• Computing tournament solutions using relation algebra and RelView
• Title not available (Why is that?)
• A new algebraic approach to L-fuzzy relations convenient to study crispness
• Dijkstra, Floyd and Warshall meet Kleene
• Regular Algebra Applied to Path-finding Problems
• Relational style laws and constructs of linear algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Categorical representation theorems of fuzzy relations
• Crispness in Dedekind categories
• Representations of ordered semigroups and lattices by binary relations
• Axiomatizability of positive algebras of binary relations
• Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL
• Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm
• Title not available (Why is that?)
• Relations among Matrices over a Semiring
• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Title not available (Why is that?)

Cited In (4)

• Verifying minimum spanning tree algorithms with Stone relation algebras
• Stone Algebras
• Stone Relation Algebras
• An algebraic framework for minimum spanning tree problems

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)