Volume II completes the description of the main aspects of the theory, covering representation questions, model theory and decision problems for them, translations from logic to algebra and vice-versa, and relationships with other algebraic versions of logic.

Algebraic logic is a subject in the interface between logic, algebra and geometry, it has strong connections with category theory and combinatorics. Tarski’s quest for finding structure in logic leads to cylindric-like algebras as studied in this book, they are among the main players in Tarskian algebraic logic. Cylindric algebra theory can be viewed in many ways: as an algebraic form of definability theory, as a study of higher-dimensional relations, as an enrichment of Boolean Algebra theory, or, as logic in geometric form (“cylindric” in the name refers to geometric aspects). Cylindric-like algebras have a wide range of applications, in, e.g., natural language theory, data-base theory, stochastics, and even in relativity theory. The present volume, consisting of 18 survey papers, intends to give an overview of the main achievements and new research directions in the past 30 years, since the publication of the Henkin-Monk-Tarski monographs. It is dedicated to the memory of Leon Henkin.​

Volume I provides a detailed analysis of cylindric algebras, starting with a formulation of their axioms and a development of their elementary properties, and proceeding to a deeper study of their interrelationships by means of general algebraic notions such as subalgebras, homomorphisms, direct products, free algebras, reducts and relativized algebras.

This is an introduction to mathematical logic in which all the usual topics are presented: compactness and axiomatizability of semantical consequence, Löwenheim-Skolem-Tarski theorems, prenex and other normal forms, and characterizations of elementary classes with the help of ultraproducts. Logic is based exclusively on semantics: truth and satisfiability of formulas in structures are the basic notions. The methods are algebraic in the sense that notions such as homomorphisms and congruence relations are applied throughout in order to gain new insights. These concepts are developed and can be viewed as a first course on universal algebra. The approach to algorithms generating semantical consequences is algebraic as well: for equations in algebras, for propositional formulas, for open formulas of predicate logic, and for the formulas of quantifier logic. The structural description of logical consequence is a straightforward extension of that of equational consequence, as long as Boolean valued propositions and Boolean valued structures are considered; the reduction of the classical 2-valued case then depends on the Boolean prime ideal theorem.

This book constitutes the refereed proceedings of the 13th International Conference on Mathematics of Program Construction, MPC 2019, held in Porto, Portugal, in October 2019. The 15 revised full papers presented together with an invited paper were carefully reviewed and selected from 22 submissions. The papers deal with mathematical principles and techniques for constructing computer programs. They range from algorithmics to support for program construction in programming languages and systems. Some typical areas are type systems, program analysis and transformation, programming-language semantics, security, and program logics.