go-v.orgcodex
Menu
Page tools

codex · Philosophy

Symmetric Boolean function

In mathematics, a symmetric Boolean function is a Boolean function whose value does not depend on the order of its input bits, i.e., it depends only on the number of ones (or zeros) in the input. For this reason, they are also known as Boolean counting functions. There are 2n+1 symmetric n-ary Boolean functions. Instead of the truth table, traditionally used to represent Boolean functions, one may use a more compact representation for an n-variable symmetric Boolean function: the (n + 1)-vector whose i-th entry (i = 0, ..., n) is the value of the function on an input vector with i ones.

Mathematically, the symmetric Boolean functions correspond one-to-one with the functions that map n+1 elements to two elements, f:{0,1,...,n}→{0,1}. Symmetric Boolean functions are used to classify Boolean satisfiability problems.

Wikipedia contributors, "Symmetric Boolean function", Wikipedia, revision 1384537047, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex