Generating clones with conservative near-unanimity operation
Logic
2015-03-30 v1
Abstract
Due to the Baker-Pixley theorem we know that every clone over a finite domain containing a near-unanimity operation is finitely generated. Therefore there exists an integer such that the clone is generated by its -ary part. In this paper we are interested in the size of for a fixed and fixed arity of a conservative . We obtain lower bounds for all arities and they turn out to be sharp for arity three.
Cite
@article{arxiv.1503.07986,
title = {Generating clones with conservative near-unanimity operation},
author = {Johannes Greiner},
journal= {arXiv preprint arXiv:1503.07986},
year = {2015}
}