Difference between revisions of "Boolean function"
MyWikiBiz, Author Your Legacy — Thursday November 21, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (→Document history: fix link (several articles were merged @ GetWiki)) |
Jon Awbrey (talk | contribs) (standardize syllabus & add document history) |
||
Line 1: | Line 1: | ||
− | + | A '''finitary boolean function''' is a [[function (mathematics)|function]] of the form <math>f : \mathbb{B}^k \to \mathbb{B},</math> where <math>\mathbb{B} = \{ 0, 1 \}</math> is a [[boolean domain]] and where <math>k\!</math> is a nonnegative integer. In the case where <math>k = 0,\!</math> the function is simply a constant element of <math>\mathbb{B}.</math> | |
− | There are <math>2^{2^k}</math> such functions. These play a basic role in questions of [[complexity theory]] as well as the design of circuits and chips for | + | There are <math>2^{2^k}</math> such functions. These play a basic role in questions of [[complexity theory]] as well as the design of circuits and chips for digital computers. |
− | == | + | ==Syllabus== |
+ | |||
+ | ===Logical operators=== | ||
{{col-begin}} | {{col-begin}} | ||
{{col-break}} | {{col-break}} | ||
− | * [[ | + | * [[Exclusive disjunction]] |
− | * [[ | + | * [[Logical conjunction]] |
+ | * [[Logical disjunction]] | ||
+ | * [[Logical equality]] | ||
+ | {{col-break}} | ||
+ | * [[Logical implication]] | ||
+ | * [[Logical NAND]] | ||
+ | * [[Logical NNOR]] | ||
+ | * [[Logical negation|Negation]] | ||
+ | {{col-end}} | ||
+ | |||
+ | ===Related topics=== | ||
+ | |||
+ | {{col-begin}} | ||
+ | {{col-break}} | ||
+ | * [[Ampheck]] | ||
* [[Boolean domain]] | * [[Boolean domain]] | ||
+ | * [[Boolean function]] | ||
+ | * [[Boolean-valued function]] | ||
{{col-break}} | {{col-break}} | ||
− | * [[ | + | * [[Logical graph]] |
− | * [[ | + | * [[Logical matrix]] |
+ | * [[Minimal negation operator]] | ||
+ | * [[Peirce's law]] | ||
+ | {{col-break}} | ||
+ | * [[Propositional calculus]] | ||
+ | * [[Truth table]] | ||
+ | * [[Universe of discourse]] | ||
* [[Zeroth order logic]] | * [[Zeroth order logic]] | ||
{{col-end}} | {{col-end}} | ||
− | |||
− | |||
− | |||
− | |||
==Document history== | ==Document history== | ||
Line 24: | Line 44: | ||
Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders. | Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders. | ||
− | * [http:// | + | {{col-begin}} |
− | + | {{col-break}} | |
− | * [http://wikinfo.org/index.php/Boolean_function Boolean | + | * [http://mywikibiz.com/Boolean_function Boolean Function], [http://mywikibiz.com/ MyWikiBiz] |
+ | * [http://beta.wikiversity.org/wiki/Boolean_function Boolean Function], [http://beta.wikiversity.org/ Beta Wikiversity] | ||
+ | * [http://planetmath.org/encyclopedia/BooleanFunction.html Boolean Function], [http://planetmath.org/ PlanetMath] | ||
+ | {{col-break}} | ||
+ | * [http://www.wikinfo.org/index.php/Boolean_function Boolean Function], [http://www.wikinfo.org/ Wikinfo] | ||
+ | * [http://www.textop.org/wiki/index.php?title=Boolean_function Boolean Function], [http://www.textop.org/wiki/ Textop Wiki] | ||
+ | * [http://en.wikipedia.org/w/index.php?title=Boolean_function&oldid=60886833 Boolean Function], [http://en.wikipedia.org/ Wikipedia] | ||
+ | {{col-end}} | ||
− | + | <br><sharethis /> | |
− | [[Category: | + | [[Category:Combinatorics]] |
− | [[Category: | + | [[Category:Computer Science]] |
+ | [[Category:Discrete Mathematics]] | ||
[[Category:Logic]] | [[Category:Logic]] | ||
[[Category:Mathematics]] | [[Category:Mathematics]] |
Revision as of 01:20, 7 April 2010
A finitary boolean function is a function of the form \(f : \mathbb{B}^k \to \mathbb{B},\) where \(\mathbb{B} = \{ 0, 1 \}\) is a boolean domain and where \(k\!\) is a nonnegative integer. In the case where \(k = 0,\!\) the function is simply a constant element of \(\mathbb{B}.\)
There are \(2^{2^k}\) such functions. These play a basic role in questions of complexity theory as well as the design of circuits and chips for digital computers.
Syllabus
Logical operators
Template:Col-breakTemplate:Col-breakTemplate:Col-endRelated topics
Document history
Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.
<sharethis />