Books > Science & Mathematics > Mathematics > Algebra
|
Buy Now
Universal Algebra for Computer Scientists (Paperback, Softcover reprint of the original 1st ed. 1992)
Loot Price: R2,991
Discovery Miles 29 910
|
|
Universal Algebra for Computer Scientists (Paperback, Softcover reprint of the original 1st ed. 1992)
Series: Monographs in Theoretical Computer Science. An EATCS Series, 25
Expected to ship within 10 - 15 working days
|
Donate to Gift Of The Givers
Total price: R3,011
Discovery Miles: 30 110
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.