Book contents
- Frontmatter
- Contents
- Preface
- 1 Motivating Examples
- 2 Abstract Reduction Systems
- 3 Universal Algebra
- 4 Equational Problems
- 5 Termination
- 6 Confluence
- 7 Completion
- 8 Gröbner Bases and Buchberger's Algorithm
- 9 Combination Problems
- 10 Equational Unification
- 11 Extensions
- Appendix 1 Ordered Sets
- Appendix 2 A Bluffer's Guide to ml
- Bibliography
- Index
3 - Universal Algebra
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Contents
- Preface
- 1 Motivating Examples
- 2 Abstract Reduction Systems
- 3 Universal Algebra
- 4 Equational Problems
- 5 Termination
- 6 Confluence
- 7 Completion
- 8 Gröbner Bases and Buchberger's Algorithm
- 9 Combination Problems
- 10 Equational Unification
- 11 Extensions
- Appendix 1 Ordered Sets
- Appendix 2 A Bluffer's Guide to ml
- Bibliography
- Index
Summary
The purpose of this chapter is twofold. On the one hand, it introduces basic notions from universal algebra (such as terms, substitutions, and identities) on a syntactic level that does not require (or give) much mathematical background. On the other hand, it presents the semantic counterparts of these syntactic notions (such as algebras, homomorphisms, and equational classes), and proves some elementary results on their connections. Most of the definitions and results presented in subsequent chapters can be understood knowing only the syntactic level introduced in Section 3.1. In order to obtain a deeper understanding of the meaning of these results, and of the context in which they are of interest, a study of the other sections in this chapter is recommended, however. For more information on universal algebra see, for example, [100, 55, 173].
Terms, substitutions, and identities
Terms will be built from function symbols and variables in the usual way. For example, if f is a binary function symbol, and x, y are variables, then f(x,y) is a term. To make clear which function symbols are available in a certain context, and which arity they have, one introduces signatures.
Definition 3.1.1 A signature Σ is a set of function symbols, where each f ∈ Σ is associated with a non-negative integer n, the arity of f. For n ≥ 0, we denote the set of all n-ary elements of Σ by Σ(n). The elements of Σ(0) are also called constant symbols.
- Type
- Chapter
- Information
- Term Rewriting and All That , pp. 34 - 57Publisher: Cambridge University PressPrint publication year: 1998