Set-reconstructibility of Post classes
Combinatorics
2016-11-22 v1 Rings and Algebras
Abstract
The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaing clones are not weakly reconstructible.
Cite
@article{arxiv.1310.7797,
title = {Set-reconstructibility of Post classes},
author = {Miguel Couceiro and Erkko Lehtonen and Karsten Schölzel},
journal= {arXiv preprint arXiv:1310.7797},
year = {2016}
}
Comments
8 pages. arXiv admin note: text overlap with arXiv:1306.5578