Rippling: Meta-level Guidance for Mathematical Reasoning

Before going into details particular to rippling, we need a few general preliminaries concerning terms and rewriting. We use standard definitions here (see, for example, Baader and Nipkow (1998)).
Terms are built from function symbols and variables in the usual way. To make clear which function s ymbols are available in a given context, and what arity they have, we work with signatures. A signature ? is a set of function symbols where each f ? ? is associated with a non-negative integer n, the arity of f. We will write ? ( n ) to denote the set of function symbols in ? of arity n. Functions in ? (0) are constants. The set of terms
built from ? and a set of variables
(disjoint from ?) is inductively defined:
and if f ? ? ( n ) and t 1,..., t n ?
, then f( t 1,..., t n) ?
. We write
? for ground terms (
= ) and omit both ? and
and simply write
when these are implicitly given or their identity is unimportant.
Note that, in many applications, it is helpful to impose a sort discipline where terms and operations on them are partitioned into different classes. For instance, in the examples in Chapter 2, the reader will see that...