Set-reconstructibility of Post classes
arXiv:1310.7797 · doi:10.1016/j.dam.2015.02.013
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.
8 pages. arXiv admin note: text overlap with arXiv:1306.5578
References in corpus (4)
- Generalizations of Swierczkowski's lemma and the arity gap of finite functions
- Reconstructing multisets over commutative groupoids and affine functions over nonassociative semirings
- Hypomorphic Sperner systems and nonreconstructible functions
- On the reconstructibility of totally symmetric functions and of other functions with a unique identification minor