Set-reconstructibility of Post classes

Miguel Couceiro (1) , Erkko Lehtonen (2) , Karsten Schölzel (3)

1 ORPAILLEUR - Knowledge representation, reasonning
2 CSC - Computer Science and Communications Research Unit [Luxembourg]
3 Mathematics Research Unit

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.

Mots clés: Reconstruction problem; Boolean function; Clone

Domaines: Mathématiques [math]

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⟩