Studies of Boolean functions/terminology

From Wikiversity
Jump to navigation Jump to search
  • (Boolean) function, BF      usually meant as BF with infinite arity and periodic truth table      similar to Boolean expression
  • truth table, TT      usually meant as a truth table of finite length, determined by an arity
  • valency ≤ adicity ≤ arity
    Valency is the number of arguments actually used. It is the number of circles in the Euler diagram.
    Adicity follows from the biggest atom. 2adicity is the required TT length, or the period length of the infinite truth table.
    The term arity is used where a finite truth table is needed. E.g. can be shown as 3-ary 0000 0011 or as 4-ary 0000 0011 0000 0011.
    (But the term arity may linger for a while, where valency or adicity shold be used.)
  • atom      Atoms are also called sets or arguments of a BF.      what is usually shown by a circle and labeled A, B, C...
  • dense      There are no gaps before or between the atoms. Valency and adicity are equal.      often called non-degenerate
  • spread      not dense
  • segment      geometric element of an Euler diagram, e.g. its cells and the walls between them      The number of segments in a Venn diagram is 3valency.
  • spot      cell of an Euler diagram      defined as segment with dimension 0      The number of spots in a Venn diagram is 2valency.
  • fullspot      corresponds to true place in TT
  • gapspot      corresponds to false place in TT, but necessary for geometrically sound Euler diagram
  • link      connection between neighboring spots, i.e. wall between cells      defined as segment with dimension 1
  • border      set of links that belong to the same atom, i.e. all walls of the same color
  • split      set without the notion of inside and outside      usually the same as a partition into two blocks
  • hypersplit      generalization of a split      partitions space into 2n orthants
  • filtrate      reduction of a BF to a subset of its atoms, i.e. what remains when some circles are removed from the Euler diagram
  • blighted      arity can be reduced      bloated or blotted      (blight, blightless)
  • bloated      some arguments are equal or complementary to each other      (bloat, bloatless)
  • blotted      some arguments are equal or complementary to niverse or empty set      (blot, blotless)
  • transformation      signed permutation that turns elements of the same clan into each other
  • clan      negation and permutation equivalence class      partitioned into families and factions
  • family      negation equivalence class
  • faction      permutation equivalence class
  • (Zhegalkin) twin      Zhegalkin index interpreted as TT of the same length      (E.g. all bits true and only left bit true are always twins, because the Zhegalkin index of the tautology is 1.)
  • junior (senior)      Boolean functions of arity n−1 are junior to those of arity n (and those of arity n+1 are senior)     
  • junarity (senarity)      arity − 1 (arity + 1)
  • gentle      set of TTs is gentle iff identical to set of twins
foibles
  • foible      The foibles are seven properties, that correspond to the vertices of a Fano plane. Most important are odd and odious.
  • even/odd      foible of a BF, equal to first digit of TT      oddness also called parity
  • evil/odious      foible of a BF, equal to last digit of TT      odiousness also called depravity      BF is evil/odious iff Ж has even/odd weight
  • ugly      foible of a BF, XOR of odd and odious      uglyness
  • dull/sharp      foible of a BF, equal to parity of TT weight      sharpness
  • obtuse/acute      foible of a BF, similar to sharpness      acuteness
  • rude and rough      foibles of a BF, similar to sharpness and acuteness      rudeness and roughness
  • quadrant = odd + 2 · odious ∈ {0, 1, 2, 3}