Infinite irredundant equational axiomatisability for a finite monoid
Logic
2015-11-20 v1 Combinatorics
Abstract
It is shown that a finite monoid can have an infinite irredundant basis of equations.
Cite
@article{arxiv.1511.05979,
title = {Infinite irredundant equational axiomatisability for a finite monoid},
author = {Marcel Jackson},
journal= {arXiv preprint arXiv:1511.05979},
year = {2015}
}