Skip to main content
SpringerLink
Log in

Universal Algebra for Computer Scientists

  • Book
  • © 1992

Overview

Authors:
  1. Wolfgang Wechler

    1. Institut für Informatik, Universität Würzburg, Würzburg, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS, volume 25)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (4 chapters)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Preliminaries

    • Wolfgang Wechler
    Pages 1-88

  3. Reductions

    • Wolfgang Wechler
    Pages 89-133

  4. Universal Algebra

    • Wolfgang Wechler
    Pages 135-241

  5. Applications

    • Wolfgang Wechler
    Pages 243-295

  6. Back Matter

    Pages 297-341
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Institut für Informatik, Universität Würzburg, Würzburg, Germany

    Wolfgang Wechler

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation