Boolean Primitives as Symmetric Boolean Functions

The Boolean functions And, Nand, Or, Nor, Xor, Xnor, Equivalent, and Majority are all special cases of the general symmetric function BooleanCountingFunction. This explores the equivalence by giving the implementation of the primitives in terms of arguments to BooleanCountingFunction and truth tables.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.