## Step by Step - Building Representations in Algebraic Logic (1995)

Venue: | Journal of Symbolic Logic |

Citations: | 28 - 15 self |

### BibTeX

@ARTICLE{Hirsch95stepby,

author = {Robin Hirsch and Ian Hodkinson},

title = {Step by Step - Building Representations in Algebraic Logic},

journal = {Journal of Symbolic Logic},

year = {1995},

volume = {62},

pages = {225--279}

}

### Years of Citing Articles

### OpenURL

### Abstract

We consider the problem of finding and classifying representations in algebraic logic. This is approached by letting two players build a representation using a game. Homogeneous and universal representations are characterised according to the outcome of certain games. The Lyndon conditions defining representable relation algebras (for the finite case) and a similar schema for cylindric algebras are derived. Countable relation algebras with homogeneous representations are characterised by first order formulas. Equivalence games are defined, and are used to establish whether an algebra is !-categorical. We have a simple proof that the perfect extension of a representable relation algebra is completely representable. An important open problem from algebraic logic is addressed by devising another twoplayer game, and using it to derive equational axiomatisations for the classes of all representable relation algebras and representable cylindric algebras. Other instances of this ap...