Decidability of Relation Algebras with Weakened Associativity

1987 ◽  
Vol 100 (2) ◽  
pp. 340 ◽  
Author(s):  
I. Nemeti
Keyword(s):  
Relation Algebras

scholarly journals A Microcomputer Based System for Small Relation Algebras

1994 ◽  
Vol 18 (1) ◽  
pp. 83-86 ◽  
Author(s):  
Ivo Düntsch
Keyword(s):  
Relation Algebras

A completeness theorem for higher order logics

2000 ◽  
Vol 65 (2) ◽  
pp. 857-884 ◽  
Author(s):  
Gábor Sági
Keyword(s):  
Set Theory ◽  
Representation Theorem ◽  
Completeness Theorem ◽  
Higher Order ◽  
Algebraic Solution ◽  
Algebraic Proof ◽  
Relation Algebras ◽  
Cylindric Algebras ◽  
Strong Representation ◽  
Algebraic Counterpart

AbstractHere we investigate the classes of representable directed cylindric algebras of dimension α introduced by Németi [12]. can be seen in two different ways: first, as an algebraic counterpart of higher order logics and second, as a cylindric algebraic analogue of Quasi-Projective Relation Algebras. We will give a new, “purely cylindric algebraic” proof for the following theorems of Németi: (i) is a finitely axiomatizable variety whenever α ≥ 3 is finite and (ii) one can obtain a strong representation theorem for if one chooses an appropriate (non-well-founded) set theory as foundation of mathematics. These results provide a purely cylindric algebraic solution for the Finitization Problem (in the sense of [11]) in some non-well-founded set theories.

Median algebras, Relation algebras, C-algebras

2003 ◽  
pp. 267-274
Author(s):  
Piergiulio Corsini ◽  
Violeta Leoreanu
Keyword(s):  
Relation Algebras ◽  
C Algebras

Matrix relation algebras

2002 ◽  
Vol 48 (3) ◽  
pp. 273-299 ◽  
Author(s):  
M. El Bachraoui ◽  
M. Van de Vel
Keyword(s):  
Relation Algebras ◽  
Matrix Relation
Sign in / Sign up

Export Citation Format

Share Document