Set-reconstructibility of Post classes
classification
🧮 math.CO
math.RA
keywords
clonesfunctionsset-reconstructibilityaffinebooleanclassesclassifiedconjunctions
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.