Szabolcs Mikulas:
Axiomatizability of reducts of RRA
Abstract
The aim of this talk is to give an overview of the axiomatizability
problem of algebras of binary relations. We will focus on the finite
axiomatizability of several fragments of Tarski's class of
representable relation algebras. Finite axiomatizability results can
be established by using the step-by-step method, while ultraproduct
constructions yield non-finite axiomatizability. We will conclude
with some open problems that could be tackled using either of the
above methods.