Mathematical logic quarterly · 1997 · 16 citations · 5 references
Natural SciencesComputer ScienceMathematicsAlgebraLogicSet TheoryAxiomatic Set TheoryBoolean AlgebraBoolean OperationsBoolean FunctionsMonotone Boolean Functions
Abstract We describe sets of partial Boolean functions being closed under the operations of superposition. For any class A of total functions we define the set 𝔐( A ) consisting of all partial classes which contain precisely the functions of A as total functions. The cardinalities of such sets 𝔐( A ) can be finite or infinite. We state some general results on 𝔐( A ). In particular, we describe all 30 closed sets of partial Boolean functions which contain all monotone and zero‐preserving total Boolean functions.
5
Stéphane Crépey, Olivier Guéant, David Hobson et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2011 · 10.2K citations
Introduction to a General Theory of Elementary Propositions
Emil L. Post · American Journal of Mathematics · 1921 · 1K citations
Humanities, Mathematics, Logic +7
Completeness theory for finite partial algebras
Lucien Haddad, Ivo G. Rosenberg · Algebra Universalis · 1992 · 39 citations