The basic notions of the theory of term rewriting are defined for terms that may involve function letters of infinite arity. A sufficient condition for completeness is derived, and its useâ€¦ (More)

In this paper, we survey 3-valued logics and their complete axiomatizations, one of which is new. We then propose a 4-valued, functionally complete logic that incorporates these 3-valued systems andâ€¦ (More)

We propose an extension of purely equational reasoning with an induction rule, to obtain an intermediate between the equational theory of an algebraic specification and its !-closure.

A meadow is a commutative ring with a total inverse operator satisfying 0 = 0. We show that the class of finite meadows is the closure of the class of Galois fields under finite products. As aâ€¦ (More)

In abstract algebra, a field is a structure with total operations of addition, subtraction and multiplication. Moreover, every element has a multiplicative inverseâ€”except 0. In a field, the rulesâ€¦ (More)