Weakly representable but not representable relation algebras (Q1337158)

A relation algebra \((A,+,\cdot, ^ -, 0,1,\circ, \breve{\;}, 1 {\text{'}})\) is said to be representable (weakly representable) if it is representable as an algebra of binary relations, where all of its operations (except perhaps \(+\) and \(^ -\)) have their natural set- theoretic meaning, i.e., union, intersection, complementation, empty set, biggest set, relation composition, inverse or converse and identity relation, respectively. The main theorem of this paper states that the class of representable relation algebras is not finitely axiomatizable over the class of weakly representable relation algebras, i.e., no finite set of first order formulas can be added to the axioms of the latter class so as to obtain a system of axioms for the former class. This implies in particular the existence of the algebras in the title of the paper, thus answering a question raised by B. Jónsson.