Universal Algebra for Computer Scientists (Monographs in Theoretical Computer Science. An EATCS Series) - gebrauchtes Buch

EAN (ISBN-13): 9783540542803
ISBN (ISBN-10): 3540542809
Gebundene Ausgabe
Erscheinungsjahr: 1992
Herausgeber: Springer

Buch in der Datenbank seit 2008-01-27T17:31:32+01:00 (Berlin)
Detailseite zuletzt geändert am 2023-03-22T10:28:34+01:00 (Berlin)
ISBN/EAN: 3540542809

ISBN - alternative Schreibweisen:
3-540-54280-9, 978-3-540-54280-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: universal algebra, computer scientists

---

Daten vom Verlag:

Autor/in: Wolfgang Wechler
Titel: Monographs in Theoretical Computer Science. An EATCS Series; Universal Algebra for Computer Scientists
Verlag: Springer; Springer Berlin
339 Seiten
Erscheinungsjahr: 1992-02-10
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Gewicht: 0,715 kg
Sprache: Englisch
85,55 € (DE)
87,95 € (AT)
106,60 CHF (CH)
Not available, publisher indicates OP

BB; Book; Hardcover, Softcover / Informatik, EDV/Informatik; Computerprogrammierung und Softwareentwicklung; Verstehen; Fixpunkt (Math.); computer science; Algebraische Semantik; Algebraic Semantics; algebra; term rewriting; Algebraische Spezifikation; development; Notation; Fixpiont Methods; Termersetzung; Abstrakter Datentyp; semantics; B; Logics and Meanings of Programs; Computer Science; Software Engineering; Symbolic and Algebraic Manipulation; Data Structures; Algebra; Rechnerarchitektur und Logik-Entwurf; Software Engineering; Mathematik für Informatiker; Algorithmen und Datenstrukturen; Algebra; BC; EA

1 Preliminaries.- 1.1 Basic Notions.- 1.1.1 Sets.- 1.1.2 Algebras.- 1.2 Generation, Structural Induction, Algebraic Recursion and Deductive Systems.- 1.2.1 Generation.- 1.2.2 Structural Induction.- 1.2.3 Terms and Algebraic Recursion.- 1.2.4 Deductive Systems.- 1.3 Relations.- 1.3.1 Regular Operations.- 1.3.2 Equivalence Relations.- 1.3.3 Partial Orders.- 1.3.4 Terminating Relations.- 1.3.5 Well-Quasi-Orders.- 1.3.6 Cofinality, Multiset Ordering and Polynomial Ordering.- 1.4 Trees.- 1.4.1 Trees and Well-Founded Partially Ordered Sets.- 1.4.2 Labelled Trees.- 1.5 ?-Complete Posets and Fixpoint Theorem.- 1.5.1 ?-Complete Posets.- 1.5.2 Fixpoint Theorem.- 1.5.3 Free ?-Completion.- 2 Reductions.- 2.1 Word Problem.- 2.1.1 Confluence Method.- 2.1.2 Word Problem for Congruences.- 2.2 Reduction Systems.- 2.2.1 Abstract Reduction Systems.- 2.2.2 Term Rewriting Systems.- 2.2.3 Termination of Term Rewriting Systems.- 3 Universal Algebra.- 3.1 Basic Constructions.- 3.1.1 Subalgebras and Generation.- 3.1.2 Images and Presentation.- 3.1.3 Direct Products and Subdirect Decompositions.- 3.1.4 Reduced Products and Ultraproducts.- 3.2 Equationally Defined Classes of Algebras.- 3.2.1 Equations.- 3.2.2 Free Algebras.- 3.2.3 Varieties.- 3.2.4 Equational Theories.- 3.2.5 Term Rewriting as an Algorithmic Tool for Equational Theories.- 3.3 Implicationally Defined Classes of Algebras.- 3.3.1 Implications, Finitary Implications and Universal Horn Clauses.- 3.3.2 Sur-Reflections.- 3.3.3 Sur-Reflective Classes, Semivarieties and Quasivarieties.- 3.3.4 Implicational Theories.- 3.3.5 Universal Horn Theories.- 3.3.6 Conditional Equational Theories and Conditional Term Rewriting.- 4 Applications.- 4.1 Algebraic Specification of Abstract Data Types.- 4.1.1 Many-Sorted Algebras.- 4.1.2 Initial Semantics of Equational Specifications.- 4.1.3 Operational Semantics.- 4.2 Algebraic Semantics of Recursive Program Schemes.- 4.2.1 Ordered Algebras.- 4.2.2 Strict Ordered Algebras.- 4.2.3 ?-Complete Ordered Algebras.- 4.2.4 Recursive Program Schemes.- References.- Appendix 1: Sets and Classes.- Appendix 2: Ordered Algebras as First-Order Structures.
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.