Applying term rewriting to partial algebra theory

Authors:
Norbert Dojer
Affiliations:
Faculty of Mathematics, Informatics and Mechanics Warsaw University, Banacha 2, 02-097 Warszawa, Poland
Venue:
Fundamenta Informaticae
Year:
2004

Citing 5
Cited 1

Partial algebras flow from algebraic specifications

14th International Colloquium on Automata, languages and programming
Term rewriting induction

CADE-10 Proceedings of the tenth international conference on Automated deduction
Testing for inductive (Co)-reducibility

CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
Algebraic specification

Handbook of theoretical computer science (vol. B)
Term rewriting and all that

Term rewriting and all that

Untyping typed algebraic structures and colouring proof nets of cyclic linear logic

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

In our paper we apply term rewriting to decidability of equations in classes of partial algebras, as well as to embeddability of partial algebras into classes of total ones. We follow the approach to partial algebras introduced by H.J. Kreowski in [13], in which (classes of) partial algebras are described by means of (classes of) total ones.