Algebraization of quantifier logics, an introductory overview (Q1189899)

This is a survey of algebraic quantifier logic, with emphasis on the derivation of algebraic versions from the semantics of logic. Much attention is given to the problem of finding finitely axiomatizable varieties, where the results are generally negative. The survey begins with Tarski-style relation algebras, and then proceeds to a discussion of cylindric algebras. In both cases the main results are clearly formulated, and connections to other approaches are indicated. For logic without equality the emphasis is on polyadic algebras and variants. Finally, several less worked-out algebraic theories are briefly mentioned: many-sorted cylindric algebras, partial cylindric algebras, algebras of finite sequences, the Rasiowa-Sikorski approach, connections with computer science, connections with category-theoretic logic, Boolean algebras with operators, combinatory logic, and universal algebraic logic. The article should be of special interest to researchers who have a small amount of knowledge of the field and want to know the main results in order to decide what to study further. But also experts will find new things here.