Set-reconstructibility of Post classes - Archive ouverte HAL
Article Dans Une Revue Discrete Applied Mathematics Année : 2015

Set-reconstructibility of Post classes

Résumé

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.

Dates et versions

hal-01090618 , version 1 (03-12-2014)

Identifiants

Citer

Miguel Couceiro, Erkko Lehtonen, Karsten Schölzel. Set-reconstructibility of Post classes. Discrete Applied Mathematics, 2015, 187, pp.12-18. ⟨10.1016/j.dam.2015.02.013⟩. ⟨hal-01090618⟩
189 Consultations
0 Téléchargements

Altmetric

Partager

More