For the purposes of TOCL, the field of computational logic consists of all uses of logic in computer science. This area has a great tradition in computer science. Several researchers who earned the ACM Turing award have also contributed to this field, namely Edgar Codd (relational database systems), Stephen Cook (complexity of logical theories), Edsger W. Dijkstra, Robert W. Floyd, Tony Hoare, Amir Pnueli, and Dana Scott (program logics, program derivation and verification, programming languages semantics), Robin Milner (interactive theorem proving, concurrency calculi, and functional programming), and John McCarthy (functional programming and logics in AI).
This journal publishes results of the latest research in the areas of modern general algebra and of logic considered primarily from an algebraic viewpoint. The algebraic papers, constituting the major part of the contents, are concerned with studies in such fields as ordered, almost torsion-free, nilpotent, and metabelian groups; isomorphism rings; Lie algebras; Frattini subgroups; and clusters of algebras. In the area of logic, the periodical covers such topics as hierarchical sets, logical automata, and recursive functions. Algebra and Logic is a translation of the peer-reviewed journal Algebra I Logika, a publication of the Siberian Fund for Algebra and Logic and the Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences. More information is available at the editor's website via the following link:http://math.nsc.ru/~alglog/