Relation algebras of Sugihara, Belnap, Meyer, and Church

DOI10.1016/j.jlamp.2020.100604zbMath1484.03133arXiv1901.01555OpenAlexW3086108566MaRDI QIDQ2210869

Richard L. Kramer, Roger D. Maddux

Publication date: 9 November 2020

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.01555

zbMATH Keywords

crystal latticerelevance logicSugihara matrices\(R\)-mingledefinitional reductproper relation algebras

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Cylindric and polyadic algebras; relation algebras (03G15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Optimization in temporal qualitative constraint networks
• On the ternary relation and conditionality
• Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
• Relation algebras by games
• On when a semantics is not a semantics: some reasons for disliking the Routley-Meyer semantics for relevance logic
• The representation of relation algebras. II
• A portrait of Alfred Tarski
• Point algebras for temporal reasoning: Algorithms and complexity
• Relation algebras
• Towards a general theory of action and time
• Cylindric algebras. Part II
• Depth relevance of some paraconsistent logics
• Relevance: A fallacy?
• Common sense and relevance
• Language in action
• Models for entailment
• Classical relevant logics. I
• Classical relevant logics. II
• A Kripke-style semantics for R-mingle using a binary accessibility relation
• Alternative semantics for quantified first degree relevant logic
• What is negation?
• On point-duration networks for temporal reasoning
• Finite relation algebras with normal representations
• Algebraic foundations for qualitative calculi and networks
• Representations for small relation algebras
• The algebra \(\text{IA}^{\text{fuz}}\): a framework for qualitative fuzzy temporal reasoning
• Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
• On the consistency problem for the \(\mathcal {INDU}\) calculus
• The representation of relational algebras
• The Relevance of Relevance to Relevance Logic
• A fast algorithm and datalog inexpressibility for temporal reasoning
• Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra
• Entailment and relevance¹
• $$\mathbf {RM}$$ RM and its Nice Properties
• RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS
• Algebras of Relations and Relevance Logic
• Some Varieties Containing Relation Algebras
• On binary constraint problems
• RELEVANCE LOGICS AND RELATION ALGEBRAS
• Advanced Topics in Relation Algebras
• Introduction to Relation Algebras
• Postulates for the calculus of binary relations
• On the calculus of relations
• Boolean Algebras with Operators. Part I
• Boolean Algebras with Operators
• Qualitative Temporal and Spatial Reasoning Revisited

This page was built for publication: Relation algebras of Sugihara, Belnap, Meyer, and Church