An Infinite Descending Chain of Boolean Subfunctions Consisting of Threshold Functions


For a class C of Boolean functions, a Boolean function f is a Csubfunction of a Boolean function g, if f = g(h1, . . . , hn), where all the inner functions hi are members of C. Two functions are C-equivalent, if they are C-subfunctions of each other. The C-subfunction relation is a preorder on the set of all functions if and only if C is a clone. An… (More)


  • Presentations referencing similar topics