- Full text PDF available (6)
- This year (0)
- Last 5 years (1)
- Last 10 years (5)
Journals and Conferences
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)
Adapting a claim of Kracht (Theor Comput Sci 354:131–141, 2006), we establish a characterization of the typable partial applicative structures.