Universal Algebra for Computer Scientists (E A T C S MONOGRAPHS ON THEORETICAL COMPUTER SCIENCE) - Hardcover
Synopsis
A new model-theoretic approach to universal algebra is offered in this book. Written for computer scientists, it presents a systematic development of the methods and results of universal algebra that are useful in a variety of applications in computer science. The notation is simple and the concepts are clearly presented. The book concerns the algebraic characterization of axiomatic classes of algebras (equational, implicational, and universal Horn classes) by closure operators generalizing the famous Birkhoff Variety Theorem, and the algebraic characterization of the related theories. The book also presents a thorough study of term rewriting systems. Besides basic notions, the Knuth-Bendix completion procedure and termination proof methods are considered. A third main topic is that of fixpoint techniques and complete ordered algebras. Algebraic specifications of abstract data types and algebraic semantics of recursive program schemes are treated as applications. The book is self-contained and suitable both as a textbook for graduate courses and as a reference for researchers.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Universal Algebra for Computer Scientists (E A T C...
Seller Image
Universal Algebra for Computer Scientists (E A T C S MONOGRAPHS ON THEORETICAL COMPUTER SCIENCE)
Seller: Bay State Book Company, North Smithfield, RI, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing. Seller Inventory # BSM.Y2L5