Set-reconstructibility of Post classes

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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01090618
Contributor : Miguel Couceiro <>
Submitted on : Wednesday, December 3, 2014 - 6:19:30 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:02 PM

Links full text

Identifiers

Collections

Citation

Miguel Couceiro, Erkko Lehtonen, Karsten Schölzel. Set-reconstructibility of Post classes. Discrete Applied Mathematics, Elsevier, 2015, 187, pp.12-18. ⟨hal-01090618⟩

Share

Metrics

Record views

314