Universal Algebra for Computer Scientists
By: by Wolfgang Wechler
Series: EATCS Monographs on Theoretical Computer Science -- 25; EATCS monographs on theoretical computer science -- 25.
Publisher: Springer Berlin Heidelberg
Published: 1992
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] /
Number of pages: 339
ISBN-13: 9783642767739; 9783642767715
Subjects: Logic design; Computer science; Software engineering; Algebra; Data processing; Data structures (Computer science)
Description: 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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.