Difference between revisions of "Boolean function"

MyWikiBiz, Author Your Legacy — Wednesday December 25, 2024
Jump to navigationJump to search
(→‎Syllabus: update)
Line 101: Line 101:
 
{{col-break}}
 
{{col-break}}
 
* [[Pragmatic maxim]]
 
* [[Pragmatic maxim]]
* [[Pragmatic theory of truth]]
+
* [[Truth theory]]
 
{{col-end}}
 
{{col-end}}
  

Revision as of 11:25, 23 May 2010

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

Template:Col-breakTemplate:Col-breakTemplate:Col-end

Peer nodes

Template:Col-breakTemplate:Col-breakTemplate:Col-end

Logical operators

Template:Col-breakTemplate:Col-breakTemplate:Col-end

Related topics

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Relational concepts

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Information, Inquiry

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Related articles

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.

Template:Col-breakTemplate:Col-breakTemplate:Col-end
<sharethis />