Universal Algebra and Applications in Theoretical Computer Science

Author:   Klaus Denecke (Universitat Potsdam, Potsdam, Germany) ,  Shelly L. Wismath (University of Lethbridge, Lethbridge, Canada)
Publisher:   Taylor & Francis Inc
ISBN:  

9781584882541


Pages:   383
Publication Date:   18 January 2002
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $130.00 Quantity:  
Add to Cart

Share |

Universal Algebra and Applications in Theoretical Computer Science


Add your own review!

Overview

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.

Full Product Details

Author:   Klaus Denecke (Universitat Potsdam, Potsdam, Germany) ,  Shelly L. Wismath (University of Lethbridge, Lethbridge, Canada)
Publisher:   Taylor & Francis Inc
Imprint:   Chapman & Hall/CRC
Dimensions:   Width: 15.60cm , Height: 2.70cm , Length: 23.40cm
Weight:   0.760kg
ISBN:  

9781584882541


ISBN 10:   1584882549
Pages:   383
Publication Date:   18 January 2002
Audience:   College/higher education ,  Professional and scholarly ,  Tertiary & Higher Education ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Basic Concepts. Galois Connections and Closures. Homomorphisms and Isomorphisms. Direct and Subdirect Products. Terms, Trees, and Polynomials. Identities and Varieties. Term Rewriting Systems. Algebraic Machines. Mal'cev-type Conditions. Clones and Completeness. Tame Congruence Theory. Term Condition and Commutator. Complete Sublattices. G-Clones and M-Solid Varieties. Hypersubstitutions and Machines. Bibliography. Index.

Reviews

Author Information

Denecke, Klaus; Wismath, Shelly L.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

lgn

al

Shopping Cart
Your cart is empty
Shopping cart
Mailing List