We introduce an abstract general notion of system of equations and rewrites between terms, called Term Equational Rewrite System (TERS), and develop a sound logical deduction system, called Term Equational Rewrite Logic (TERL), to reason about equality and rewriting. Further, we give an analysis of algebraic free constructions which together with an internal completeness result may be used to s...

In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...

Equational problems (i.e.: rst-order formulae with quantiier preex 9 8 , whose only predicate symbol is syntactic equality) are an important tool in many areas of Computer Science like automated deduction, automated model building, logic programming , functional programming, etc. The aim of this work is a complexity analysis of the satissability problem of equational problems over a nite domain...

Borgström et al. proposed a notion of symbolic bisimilarity for the Extended Spi Calculus [12]. They developed a prototype tool, called SBC (Symbolic Bisimulation Checker) [10] implementing observational equivalence checking for arbitrary processes using shared-key cryptography. However, it is based on hard-coded equational theories. We have partially extended SBC towards checking processes usi...