Relation algebras by games

zbMATH Open1018.03002MaRDI QIDQ700879FDOQ700879

Ian Hodkinson, Robin Hirsch

Publication date: 15 October 2002

Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)

Recommendations

• Axiomatising Various Classes of Relation and Cylindric Algebras
• Step by step – Building representations in algebraic logic
• Relation algebras
• Relation algebra reducts of cylindric algebras and complete representations
• The Structure of Relation Algebras Generated by Relativizations

zbMATH Keywords

networksrepresentationscompletionsgamesatomsBoolean algebrasrelation algebrascylindric algebrasrelativizationnon-finite axiomatizabilitycanonical varietyhyperbasesrelational bases

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Model-theoretic algebra (03C60) Cylindric and polyadic algebras; relation algebras (03G15)

Cited In (only showing first 100 items - show all)

• First order logic without equality on relativized semantics
• Łukasiewicz-Moisil relation algebras
• Varieties generated by completions
• The finitely axiomatizable complete theories of non-associative arrow frames
• Algebraic foundations for qualitative calculi and networks
• Spatial voting games, relation algebra and RelView
• MacNeille completions and canonical extensions
• Geometrical representation theorems for cylindric-type algebras
• FINITE RELATION ALGEBRAS
• Algebraic Logic, Where Does it Stand Today?
• Relations between adjacency trees
• Axiomatizability of representable domain algebras
• Completeness for flat modal fixpoint logics
• Three-variable statements of set-pairing
• Subcompletions of representable relation algebras
• Erdős Graphs Resolve Fine's Canonicity Problem
• POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS
• Relation algebras from cylindric algebras. I
• Title not available (Why is that?)
• Canonical Relativized Cylindric Set Algebras and Weak Associativity
• Verifying minimum spanning tree algorithms with Stone relation algebras
• Relational lattices: from databases to universal algebra
• Lower semilattice-ordered residuated semigroups and substructural logics
• Functionally dense relation algebras
• Free Kleene algebras with domain
• Representable posets
• Finite, integral, and finite-dimensional relation algebras: A brief history
• Relation algebra reducts of cylindric algebras and complete representations
• Axiomatization of modal logic squares with distinguished diagonal
• Omitting types for finite variable fragments and complete representations of algebras
• Completely representable lattices
• The calculus of relations as a foundation for mathematics
• Neat embeddings, omitting types, and interpolation: an overview
• Coset relation algebras
• Relation algebras and groups
• The neat embedding problem for algebras other than cylindric algebras and for infinite dimensions
• Axiomatizing the logical core of XPath 2.0
• Relational characterisations of paths
• Finite representability of semigroups with demonic refinement
• Representability of Ramsey relation algebras
• A representation theorem for measurable relation algebras
• Relation algebras and their application in temporal and spatial reasoning
• On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality
• Structural characterizations of the navigational expressiveness of relation algebras on a tree
• Lattices of equivalence relations closed under the operations of relation algebras
• Weakly associative relation algebras with projections
• Strongly representable atom structures of cylindric algebras
• Sum-free cyclic multi-bases and constructions of Ramsey algebras
• Stone Relation Algebras
• New perspectives in algebraic logic, from neat embeddings to Erdős graphs
• Stone type representation theorems via games
• FIRST-ORDER AXIOMATISATIONS OF REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS OF UNBOUNDED QUANTIFIER DEPTH
• The algebra of functions with antidomain and range
• Axiomatizability of positive algebras of binary relations
• THERE IS NO FINITE-VARIABLE EQUATIONAL AXIOMATIZATION OF REPRESENTABLE RELATION ALGEBRAS OVER WEAKLY REPRESENTABLE RELATION ALGEBRAS
• Simulating polyadic modal logics by monadic ones
• Representability is not decidable for finite relation algebras
• Undecidability of representability as binary relations
• The polyadic generalization of the Boolean axiomatization of fields of sets
• Representations of polyadic-like equality algebras
• Undecidability of Algebras of Binary Relations
• A relation-algebraic approach to simple games
• The complexity of constraint satisfaction problems for small relation algebras
• On a Graph Calculus for Algebras of Relations
• Canonical varieties with no canonical axiomatisation
• A construction of cylindric and polyadic algebras from atomic relation algebras
• Relative expressive power of navigational querying on graphs
• Relation algebras of Sugihara, Belnap, Meyer, and Church
• Relator games on groups
• Term algebras of elementarily equivalent atom structures
• Weak representations of relation algebras and relational bases
• NONREPRESENTABLE RELATION ALGEBRAS FROM GROUPS
• Hardness of Network Satisfaction for Relation Algebras with Normal Representations
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• A simple construction of representable relation algebras with non-representable completions
• Seurat games on Stockmeyer graphs
• The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
• Representable and diagonally representable weakening relation algebras
• RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES
• Edge colourings and qualitative representations of chromatic algebras
• Positive Fork Graph Calculus
• Reducts of relation algebras: the aspects of axiomatisability and finite representability
• Notions of representability for cylindric algebras: some algebras are more representable than others
• TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY
• A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over \(\mathbb{Z} / p \mathbb{Z}\)
• On the variety generated by completions of representable relation algebras
• Omitting Types in Fragments and Extensions of First Order Logic
• Blow Up and Blur Constructions in Algebraic Logic
• On the equational complexity of RRA
• Complete Representations and Neat Embeddings
• Domain range semigroups and finite representations
• Omitting types algebraically and more about amalgamation for modal cylindric algebras
• THE VARIETY OF COSET RELATION ALGEBRAS
• Segerberg Squares of Modal Logics and Theories of Relation Algebras
• How many varieties of cylindric algebras are there
• Relator Games on Groups
• Algebras of multiplace functions for signatures containing antidomain
• A brief history of Tarskian algebraic logic with new perspectives and innovations
• Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations
• On canonicity and completions of weakly representable relation algebras

This page was built for publication: Relation algebras by games

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