A sequent calculus for relation algebras

DOI10.1016/0168-0072(83)90055-6zbMath0528.03016OpenAlexW2086495064MaRDI QIDQ786804

Roger D. Maddux

Publication date: 1983

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(83)90055-6

zbMATH Keywords

matrix algebrassequent calculusrelation algebrasprovabilitycanonical models

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Cylindric and polyadic algebras; relation algebras (03G15) Models of other mathematical theories (03C65) Other model constructions (03C30)

Related Items

Peirce algebras ⋮ Weak representations of relation algebras and relational bases ⋮ On varieties of cylindric algebras with applications to logic ⋮ Subcompletions of representable relation algebras ⋮ Dynamic logic with program specifications and its relational proof system ⋮ Axiomatization of identity-free equations valid in relation algebras ⋮ Finite, integral, and finite-dimensional relation algebras: A brief history ⋮ Relation algebras of every dimension ⋮ On a Graph Calculus for Algebras of Relations ⋮ Representable and diagonally representable weakening relation algebras ⋮ ON TARSKI’S AXIOMATIC FOUNDATIONS OF THE CALCULUS OF RELATIONS ⋮ Relational characterisations of paths ⋮ On Automating the Calculus of Relations ⋮ On canonicity and completions of weakly representable relation algebras ⋮ Language in action ⋮ Algebraization of quantifier logics, an introductory overview ⋮ Pair-Dense Relation Algebras ⋮ A Completeness Result for Relation Algebra with Binders ⋮ Strongly representable atom structures of relation algebras ⋮ Relation algebras from cylindric algebras. I ⋮ Relation algebras from cylindric algebras. II ⋮ Canonical varieties with no canonical axiomatisation ⋮ Algebraic Logic, Where Does it Stand Today? ⋮ Necessary subalgebras of simple nonintegral semiassociative relation algebras ⋮ Varieties of semiassociative relation algebras and tense algebras ⋮ An efficient relational deductive system for propositional non-classical logics ⋮ Nonfinite axiomatizability results for cylindric and relation algebras ⋮ Tarskian Classical Relevant Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof system for the first-order relational calculus
• On representable relation algebras
• Some Varieties Containing Relation Algebras
• Upper Bounds for Proof‐Search in a Sequent Calculus for Relational Equations
• Splitting in Relation Algebras
• Boolean Algebras with Operators