@inproceedings{68664950e5124ae2b3877882acb40bd4,
title = "Unification in primal algebras",
abstract = "Unification in primal algebras is shown to be unitary. Three different unification algorithms are investigated. The simplest one consists of computing all solutions and coding them up in a single vector of terms. The other two methods are generalizations of unification algorithms for Boolean algebras. Two applications are studied in more detail: Post algebras and matrix rings over finite fields. The former are algebraic models for many-valued logics, the latter cover in particular modular arithmetic. It is indicated that the results extend to arbitrary varieties of primal algebras which include all Boolean and Post algebras and p-rings.",
author = "Tobias Nipkow",
note = "Publisher Copyright: {\textcopyright} 1988, Springer-Verlag.; 13th Colloquium on Trees in Algebra and Programming, CAAP 1988 ; Conference date: 21-03-1988 Through 24-03-1988",
year = "1988",
doi = "10.1007/BFb0026100",
language = "English",
isbn = "9783540190219",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "117--131",
editor = "M. Dauchet and M. Nivat",
booktitle = "CAAP 1988 - 13th Colloquium on Trees in Algebra and Programming, Proceedings",
}