Universal Algebra and Applications in Theoretical Computer Science
eBook - PDF

Universal Algebra and Applications in Theoretical Computer Science

  1. 383 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

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

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • 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.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Universal Algebra and Applications in Theoretical Computer Science by Klaus Denecke,Shelly L. Wismath in PDF and/or ePUB format, as well as other popular books in Mathematics & Programming Algorithms. We have over one million books available in our catalogue for you to explore.

Information

Table of contents

  1. Cover
  2. Half Title
  3. Title Page
  4. Copyright Page
  5. Table of Contents
  6. Introduction
  7. 1: Basic Concepts
  8. 2: Galois Connections and Closures
  9. 3: Homomorphisms and Isomorphisms
  10. 4: Direct and Subdirect Products
  11. 5: Terms, Trees, and Polynomials
  12. 6: Identities and Varieties
  13. 7: Term Rewriting Systems
  14. 8: Algebraic Machines
  15. 9: Mal'cev-Type Conditions
  16. 10: Clones and Completeness
  17. 11: Tame Congruence Theory
  18. 12: Term Condition and Commutator
  19. 13: Complete Sublattices
  20. 14: G-Clones and M-Solid Varieties
  21. 15: Hypersubstitutions and Machines
  22. Bibliography
  23. Index