Results 1 
3 of
3
Step by Step  Building Representations in Algebraic Logic
 Journal of Symbolic Logic
, 1995
"... 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 defini ..."
Abstract

Cited by 28 (15 self)
 Add to MetaCart
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...
Relation algebras for reasoning about time and space
 Algebraic Methodology and Software Technology, Enschede 1993, Workshops in Computing Series
, 1994
"... This paper presents a brief introduction to relation algebras, including some examples motivated by work in computer science, namely, the ‘interval algebras’, relation algebras that arose from James Allen’s work on temporal reasoning, and by ‘compass algebras’, which are designed for similar reasoni ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper presents a brief introduction to relation algebras, including some examples motivated by work in computer science, namely, the ‘interval algebras’, relation algebras that arose from James Allen’s work on temporal reasoning, and by ‘compass algebras’, which are designed for similar reasoning about space. One kind of reasoning problem, called a ‘constraint satisfaction problem’, can be defined for arbitrary relation algebras. It will be shown here that the constraint satisfiability problem is NPcomplete for almost all compass and interval algebras.
Finite integral relation algebras
 Universal Algebra and Lattice Theory, Lecture Notes in Mathematics 1149
, 1985
"... Please note that this paper does not exist. It consists entirely of excerpts from the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Please note that this paper does not exist. It consists entirely of excerpts from the