Wolfram Research

Mathematica MathWorld Wolfram Science More »

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.


	Contributed by: Roger Germundsson
	Show Initialization Code

BooleanCountingFunction (Wolfram Mathematica Documentation Center)

BooleanTable (Wolfram Mathematica Documentation Center)

"Boolean Primitives as Symmetric Boolean Functions" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/BooleanPrimitivesAsSymmetricBooleanFunctions/

Contributed by: Roger Germundsson

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Related Topics

Browse all topics

Browse all education topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute

Powered by Wolfram Mathematica

Give us your feedback

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

© 2009 Wolfram Demonstrations Project & Contributors

Wolfram Research

Site Index

RSS

Atom

Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+