Premium
A simple construction of representable relation algebras with non‐representable completions
Author(s) -
Ahmed Tarek Sayed
Publication year - 2009
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.200710075
Subject(s) - simple (philosophy) , mathematics , closure (psychology) , relation (database) , class (philosophy) , finitely generated abelian group , pure mathematics , discrete mathematics , computer science , epistemology , artificial intelligence , data mining , economics , market economy , philosophy
We give a simple new construction of representable relation algebras with non‐representable completions. Using variations on our construction, we show that the elementary closure of the class of completely representable relation algebras is not finitely axiomatizable (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)