Universal Algebra for Computer Scientists: 25 (Monographs in Theoretical Computer Science. An EATCS Series, 25) - Softcover
Synopsis
A new model-theoretic approach to universal algebra for computer scientists is offered in this book. The approach covers algebraic characterization, term rewriting systems, and fixpoint methods. The book is self-contained and suitable both as a graduate text 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: 25 (Monographs...
Stock Image
Universal Algebra for Computer Scientists (eng)
Print on DemandSeller: Brook Bookstore On Demand, Napoli, NA, Italy
Seller rating 4 out of 5 stars
Condition: new. Questo è un articolo print on demand. Seller Inventory # FMTCM925KC
Buy New
£ 77.92
£ 5.96 shipping
Ships from Italy to U.S.A.
Ships from Italy to U.S.A.
Quantity: Over 20 available
Seller Image
Universal Algebra for Computer Scientists
Published by
Springer Berlin Heidelberg Aug 2012, 2012
ISBN 10: 3642767737
ISBN 13: 9783642767739
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 356 pp. Englisch. Seller Inventory # 9783642767739
Stock Image
Universal Algebra for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642767739_new
Buy New
£ 94.30
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Universal Algebra for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9783642767739
Seller Image
Universal Algebra for Computer Scientists
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642767737
ISBN 13: 9783642767739
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 scien. Seller Inventory # 5070124
Buy New
£ 81.31
£ 42.97 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Universal Algebra for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. reprint edition. 356 pages. 9.50x6.60x0.90 inches. In Stock. Seller Inventory # x-3642767737
Buy New
£ 129.24
£ 12.50 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Seller Image
Universal Algebra for Computer Scientists
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Universal Algebra for Computer Scientists | Wolfgang Wechler | Taschenbuch | xii | Englisch | 2012 | Springer | EAN 9783642767739 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 105546336
Seller Image
Universal Algebra for Computer Scientists
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 2012, 2012
ISBN 10: 3642767737
ISBN 13: 9783642767739
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 356 pp. Englisch. Seller Inventory # 9783642767739
Seller Image
Universal Algebra for Computer Scientists
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642767737
ISBN 13: 9783642767739
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783642767739
Stock Image
Universal Algebra for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series (25))
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. Like New. book. Seller Inventory # ERICA77336427677376
Buy Used
£ 137
£ 25 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available