Properties of Boolean functions/hard/permutation

Studies of Boolean functions
Properties of
Boolean functions
hard soft
binary binary
integer integer
permutation permutation

Hard properties can be assigned to a BF, without referencing its arity.
Permutations assign each BF to a unique BF.

complement

all places of the truth table negated, e.g. 0001 and 1110       (LSB of the Zhegalkin index negated)
The complement of a set of BF is the set of complements. (Families and clans can be self-complementary. Factions can not.)

reverse

truth table reversed, e.g. 0001 and 1000

dual

complement of the reverse, e.g. 0001 and 0111


This article is issued from Wikiversity. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.