Results 1 
7 of
7
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...
COMPLEXITY OF EQUATIONS VALID IN ALGEBRAS OF RELATIONS  Part II: Finite axiomatizations.
"... We study algebras whose elements are relations, and the operations are natural "manipulations" of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schroder (who expanded the Boolean tradition with extra operators to handle algebras of binary relations). Well known exam ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
We study algebras whose elements are relations, and the operations are natural "manipulations" of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schroder (who expanded the Boolean tradition with extra operators to handle algebras of binary relations). Well known examples of algebras of relations are the varieties RCAn of cylindric algebras of nary relations, RPEAn of polyadic equality algebras of nary relations, and RRA of binary relations with composition. We prove that any axiomatization, say E, of RCAn has to be very complex in the following sense: for every natural number k there is an equation in E containing more than k distinct variables and all the operation symbols, if 2 ! n ! !. Completely analogous statement holds for the case n !. This improves Monk's famous nonfinitizability theorem for which we give here a simple proof. We prove analogous nonfinitizability properties of the larger varieties SNrnCA n+k . We prove that the complementa...
An Equational ReEngineering of Set Theories
 Automated Deduction in Classical and NonClassical Logics, LNCS 1761 (LNAI
, 1998
"... New successes in dealing with set theories by means of stateoftheart theoremprovers may ensue from terse and concise axiomatizations, such as can be moulded in the framework of the (fully equational) TarskiGivant map calculus. In this paper we carry out this task in detail, setting the ground fo ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
New successes in dealing with set theories by means of stateoftheart theoremprovers may ensue from terse and concise axiomatizations, such as can be moulded in the framework of the (fully equational) TarskiGivant map calculus. In this paper we carry out this task in detail, setting the ground for a number of experiments. Key words: Set theory, relation algebras, firstorder theoremproving, algebraic logic. 1 Introduction Like other mature fields of mathematics, Set Theory deserves sustained efforts that bring to light richer and richer decidable fragments of it [5], general inference rules for reasoning in it [23, 2], effective proof strategies based on its domainknowledge, and so forth. Advances in this specialized area of automated reasoning tend, in spite of their steadiness, to be slow compared to the overall progress in the field. Many experiments with set theories have hence been carried out with standard theoremproving systems. Still today such experiments pose consider...
Notions Of Density That Imply Representability In Algebraic Logic
, 1998
"... . Henkin and Tarski proved that an atomic cylindric algebra in which every atom is a rectangle must be representable (as a cylindric set algebra) . This theorem and its analogues for quasipolyadic algebras with and without equality are formulated in HenkinMonkTarski [1985]. We introduce a nat ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. Henkin and Tarski proved that an atomic cylindric algebra in which every atom is a rectangle must be representable (as a cylindric set algebra) . This theorem and its analogues for quasipolyadic algebras with and without equality are formulated in HenkinMonkTarski [1985]. We introduce a natural and more general notion of rectangular density that can be applied to arbitrary cylindric and quasipolyadic algebras, not just atomic ones. We then show that every rectangularly dense cylindric algebra is representable, and we extend this result to other classes of algebras of logic, for example quasipolyadic algebras and substitutioncylindrification algebras with and without equality, relation algebras, and special Boolean monoids. The results of op. cit. mentioned above are special cases of our general theorems. We point out an error in the proof of the HenkinMonkTarski representation theorem for atomic equalityfree quasipolyadic algebras with rectangular atoms. The er...
A Short Proof of Representability of Fork Algebras
 Bulletin of IGPL
, 1997
"... In this paper a strong relationship is demonstrated between fork algebras and quasiprojective relation algebras. With the help of Tarski's classical representation theorem for quasiprojective relation algebras, a short proof is given for the representation theorem of fork algebras. As a byproduct ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper a strong relationship is demonstrated between fork algebras and quasiprojective relation algebras. With the help of Tarski's classical representation theorem for quasiprojective relation algebras, a short proof is given for the representation theorem of fork algebras. As a byproduct, we will discuss the difference between relative and absolute representation theorems. Fork algebras, due to their expressive power and applicability in computing science, have been intensively studied in the last four years. Their literature is alive and productive. See e.g. Baum, Frias, Haeberer, Veloso [33], [34], [3], [7], [8], [6], [9], [10] and SainSimon [27]. As described in the textbook [15] 2.7.46, in algebra, there are two kinds of representation theorems: absolute and relative representation. For fork algebras absolute representation was proved almost impossible in [18], [27], [26] 1 . However, relative representation is still possible and is quite useful (see e.g. [2]). The...
Relation Algebras from Cylindric and Polyadic Algebras
, 1997
"... This paper is a survey of recent results concerning connections between relation algebras (RA), cylindric algebras (CA) and polyadic equality algebras (PEA). We describe exactly which subsets of the standard axioms for RA are needed for axiomatizing RA over the RAreducts of CA 3 's, and we do the s ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper is a survey of recent results concerning connections between relation algebras (RA), cylindric algebras (CA) and polyadic equality algebras (PEA). We describe exactly which subsets of the standard axioms for RA are needed for axiomatizing RA over the RAreducts of CA 3 's, and we do the same for the class SA of semiassociative relation algebras. We also characterize the class of RAreducts of PEA 3 's. We investigate the interconnections between the RAaxioms within CA 3 in more detail, and show that only four implications hold between them (one of which was proved earlier by Monk). In the other direction, we introduce a natural CAtheoretic equation MGR + , a generalization of the wellknown MerryGoRound equation MGR of CAtheory. We show that MGR + is equivalent to the RAreduct being an SA, and that MGR + implies that the RAreduct determines the algebra itself, while MGR is not su#cient for either of these to hold. Then we investigate how di#erent CA's a single ...
Algebraic Formalisations of Fuzzy Relations and Their Representation Theorems
, 1998
"... The aim of this thesis is to develop the fuzzy relational calculus. To develop this calculus, we study four algebraic formalisations of fuzzy relations which are called fuzzy relation algebras, Zadeh categories, relation algebras and Dedekind categories, and we strive to arrive at their representati ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The aim of this thesis is to develop the fuzzy relational calculus. To develop this calculus, we study four algebraic formalisations of fuzzy relations which are called fuzzy relation algebras, Zadeh categories, relation algebras and Dedekind categories, and we strive to arrive at their representation theorems. The calculus of relations has been investigated since the middle of the nineteenth century. The modern algebraic study of (binary) relations, namely relational calculus, was begun by Tarski. The categorical approach to relational calculus was initiated by Mac Lane and Puppe, and Dedekind categories were introduced by Olivier and Serrato. The representation problem for Boolean relation algebras was proposed by Tarski as the question whether every Boolean relation algebra is isomorphic to an algebra of ordinary homogeneous relations. There are many sufficient conditions that guarantee representability for Boolean relation algebras. Schmidt and Strohlein gave a simple proof of the...