Boolean function: Difference between revisions

Revision as of 17:00, 16 April 2020

Revision as of 23:04, 18 April 2020

Line 1:

{{short description|Function with ___domain {0,1}^k for some k and with range {0,1} }}

distinguish Binary function more citations needed date=February 2020 A '''Boolean function''' is a [[function (mathematics)| function]] in [[mathematics]] and [[logic]] whose [[Argument of a function| arguments]], as well as the function itself, assume values from a two-element set (usually {0,1}).<ref>[https://www.encyclopediaofmath.org/index.php/ Boolean_function ''Boolean function'', Encyclopedia of Math]</ref> As a result, it is sometimes referred to as a "switching function".

{{distinguish|Binary function}}

{{more citations needed|date=February 2020}}

A '''Boolean function''' is a [[function (mathematics)|function]] in [[mathematics]] and [[logic]] whose [[Argument of a function|arguments]], as well as the function itself, assume values from a two-element set (usually {0,1}).<ref>[https://www.encyclopediaofmath.org/index.php/Boolean_function ''Boolean function'', Encyclopedia of Math]</ref> As a result, it is sometimes referred to as a "switching function".

A Boolean function takes the form ''ƒ''&nbsp;:&nbsp;'''B'''^''k''&nbsp;→&nbsp;'''B''', where '''B'''&nbsp;=&nbsp;{0,&nbsp;1} is a ''[[Boolean ___domain]]'' and ''k'' is a non-negative integer called the [[arity]] of the function. In the case where ''k''&nbsp;=&nbsp;0, the "function" is essentially a constant element of '''B'''.