
Universal Algebra and Applications in Theoretical Computer Science
- 383 pages
- English
- PDF
- Available on iOS & Android
Universal Algebra and Applications in Theoretical Computer Science
About this book
Over the past 20 years, the emergence of clone theory, hyperequational theory, commutator theory and tame congruence theory has led to a growth of universal algebra both in richness and in applications, especially in computer science. Yet most of the classic books on the subject are long out of print and, to date, no other book has integrated these theories with the long-established work that supports them.Universal Algebra and Applications in Theoretical Computer Science introduces the basic concepts of universal algebra and surveys some of the newer 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, clones, and commutators.The impact of the advances in universal algebra on computer science is just beginning to be realized, and the field will undoubtedly continue to grow and mature. Universal Algebra and Applications in Theoretical Computer Science forms an outstanding text and offers a unique opportunity to build the foundation needed for further developments in its theory and in its computer science applications.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Half Title
- Title Page
- Copyright Page
- Table of Contents
- Introduction
- 1: Basic Concepts
- 2: Galois Connections and Closures
- 3: Homomorphisms and Isomorphisms
- 4: Direct and Subdirect Products
- 5: Terms, Trees, and Polynomials
- 6: Identities and Varieties
- 7: Term Rewriting Systems
- 8: Algebraic Machines
- 9: Mal'cev-Type Conditions
- 10: Clones and Completeness
- 11: Tame Congruence Theory
- 12: Term Condition and Commutator
- 13: Complete Sublattices
- 14: G-Clones and M-Solid Varieties
- 15: Hypersubstitutions and Machines
- Bibliography
- Index