Relation algebras by games

zbMath1018.03002MaRDI QIDQ700879

I. M. Hodkinson, Robin Hirschl

Publication date: 15 October 2002

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

zbMATH Keywords

networksBoolean algebrasrepresentationscompletionsrelation algebrasatomsgamesrelativizationcylindric algebrasnon-finite axiomatizabilitycanonical varietyhyperbasesrelational bases

Mathematics Subject Classification ID

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

Related Items (99)

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

This page was built for publication: Relation algebras by games