Polynomial-time Tests for Difference Terms in Idempotent Varieties
Logic
2021-01-08 v1 Computational Complexity
Rings and Algebras
Abstract
We consider the following practical question: given a finite algebra A in a finite language, can we efficiently decide whether the variety generated by A has a difference term? We answer this question (positively) in the idempotent case and then describe algorithms for constructing difference term operations.
Cite
@article{arxiv.2011.07879,
title = {Polynomial-time Tests for Difference Terms in Idempotent Varieties},
author = {William DeMeo and Ralph Freese and Matthew Valeriote},
journal= {arXiv preprint arXiv:2011.07879},
year = {2021}
}