Victor Selivanov
(Novosibirsk)

5 December 2001

In this talk we review the current state of the theory of positive (or computably enumerable) structures. This theory is relevant to several branches of algebra, logic and computer science, e.g. to algorithmic problems in algebra, theory of quasivarieties, logic programming, algebraic specifications of data types.

Along with the general theory of positive structures we consider also positive structures of special kinds (the most interesting results are obtained for positive boolean algebras) and some appliations of positive structures to logic and computability theory.

University of Leeds, Department of Pure Mathematics, Logic Seminar 2001