Universal Algebra for Computer Scientists

Universal Algebra for Computer Scientists by Wolfgang Wechler.

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...

Full description

Saved in:
Bibliographic Details
Main Author: Wechler, Wolfgang (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1992.
Edition:1st ed. 1992.
Series:Monographs in Theoretical Computer Science. An EATCS Series, 25
Springer eBook Collection.
Subjects:
Computer logic.
Software engineering.
Computer science—Mathematics.
Data structures (Computer science).
Algebra.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items