Boolean function
MyWikiBiz, Author Your Legacy — Thursday December 26, 2024
Jump to navigationJump to search☞ This page belongs to resource collections on Logic and Inquiry.
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
Focal nodes
Peer nodes
- Boolean Function @ InterSciWiki
- Boolean Function @ MyWikiBiz
- Boolean Function @ Subject Wikis
- Boolean Function @ Wikiversity
- Boolean Function @ Wikiversity Beta
Logical operators
Template:Col-breakTemplate:Col-breakTemplate:Col-endRelated topics
- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic
Relational concepts
Information, Inquiry
Related articles
- Differential Logic : Introduction
- Differential Propositional Calculus
- Differential Logic and Dynamic Systems
- Prospects for Inquiry Driven Systems
- Introduction to Inquiry Driven Systems
- Inquiry Driven Systems : Inquiry Into Inquiry
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.
- Boolean Function, InterSciWiki
- Boolean Function, MyWikiBiz
- Boolean Function, PlanetMath
- Boolean Function, Wikinfo
- Boolean Function, Wikiversity
- Boolean Function, Wikiversity Beta
- Boolean Function, Wikipedia
