Universal Algebra and Applications in Theoretical Computer Science

Universal Algebra and Applications in Theoretical Computer Science introduces the concepts of universal algebra, surveys some of the newer developments in the field, and offers a unique opportunity to build the foundation needed for further developments in the field. The first half of the book provides a solid grounding in the core material. A leisurely pace, careful exposition, numerous examples, and exercises combine to form an introduction to the subject ideal for beginning graduate students or researchers from other areas. The second half of the book focuses on applications in theoretical computer science and advanced topics, including Mal'cev conditions, tame congruence theory, and commutators.