Wolfgang Wechler

Universal Algebra for Computer Scientists (eBook, PDF)

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 339
• Erscheinungstermin: 6. Dezember 2012
• Englisch
• ISBN-13: 9783642767715
• Artikelnr.: 53133100

Inhaltsangabe

1 Preliminaries.- 1.1 Basic Notions.- 1.2 Generation, Structural Induction, Algebraic Recursion and Deductive Systems.- 1.3 Relations.- 1.4 Trees.- 1.5 ?-Complete Posets and Fixpoint Theorem.- 2 Reductions.- 2.1 Word Problem.- 2.2 Reduction Systems.- 3 Universal Algebra.- 3.1 Basic Constructions.- 3.2 Equationally Defined Classes of Algebras.- 3.3 Implicationally Defined Classes of Algebras.- 4 Applications.- 4.1 Algebraic Specification of Abstract Data Types.- 4.2 Algebraic Semantics of Recursive Program Schemes.- References.- Appendix 1: Sets and Classes.- Appendix 2: Ordered Algebras as First-Order Structures.