Completeness of a relational calculus for program schemes

DOI10.1016/S0304-3975(99)00343-6MaRDI QIDQ5940932zbMATH OpenOpenAlexFDO

Authors Marcelo F. Frias, Roger Maddux

Publication date 20 August 2001

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

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00343-6

zbMATH Keywords

completenessprojection functionsrecursive program schemesrelational calculus

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 4053051
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
• scientific article; zbMATH DE number 67020
• An algebraic approach to schemes of structured programs

Cites work

• Boolean Algebras with Operators
• scientific article; zbMATH DE number 3683841 (Why is no real title available?)
• scientific article; zbMATH DE number 45228 (Why is no real title available?)
• scientific article; zbMATH DE number 193143 (Why is no real title available?)
• scientific article; zbMATH DE number 3537204 (Why is no real title available?)
• scientific article; zbMATH DE number 1392286 (Why is no real title available?)
• Relation algebras and Schröder categories
• Relational Methods in Computer Science
• Some sufficient conditions for the representability of relation algebras
• Varieties of relation algebras

Cited in

(2)

• Completeness proof by semantic diagrams for transitive closure of accessibility relation
• scientific article; zbMATH DE number 475195 (Why is no real title available?)

This page was built for publication: Completeness of a relational calculus for program schemes

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