Set-reconstructibility of Post classes

DOI10.1016/J.DAM.2015.02.013MaRDI QIDQ2348047zbMATH OpenOpenAlexFDO

Authors Miguel Couceiro, Erkko Lehtonen, Karsten Schölzel

Publication date 10 June 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.7797

zbMATH Keywords

Boolean functionclonereconstruction problem

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Boolean functions (06E30)

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.

Recommendations

• Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
• Boolean equations and Post classes
• Publication:3474689
• scientific article; zbMATH DE number 51303
• Compositions and clones of Boolean functions

Cites work

• A census of non-reconstructable digraphs. I: Six related families
• A family of non-reconstructible hypergraphs
• Almost every graph has reconstruction number three
• Essential arities of term operations in finite algebras
• Generalizations of Świerczkowski's lemma and the arity gap of finite functions
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3334164 (Why is no real title available?)
• Hypomorphic Sperner systems and non-reconstructible functions
• More non-reconstructible hypergraphs
• On Reconstruction of Matrices
• RECONSTRUCTING MULTISETS OVER COMMUTATIVE GROUPOIDS AND AFFINE FUNCTIONS OVER NONASSOCIATIVE SEMIRINGS
• The solution to the partition reconstruction problem
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• What is reconstruction for ordered sets?

Cited in

(6)

• Hypomorphic Sperner systems and non-reconstructible functions
• scientific article; zbMATH DE number 540524 (Why is no real title available?)
• Content and singletons bring unique identification minors
• On reconstructive sets of vertices in the Boolean cube
• Algebras, Graphs and Ordered Sets – ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet
• Reconstructing permutations from identification minors

This page was built for publication: Set-reconstructibility of Post classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348047)