Boolean algebra (nonfiction): Difference between revisions
(Created page with "In mathematics (nonfiction) and mathematical logic, '''Boolean algebra''' (or '''Boolean logic''') is the branch of algebra in which the values of the variables are the tr...") |
No edit summary |
||
Line 1: | Line 1: | ||
In [[mathematics (nonfiction)]] and mathematical logic, '''Boolean algebra''' (or '''Boolean logic''') is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively. | In [[mathematics (nonfiction)]] and mathematical logic, '''Boolean algebra''' (or '''Boolean logic''') is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively. | ||
It is thus a formalism for describing logical relations in the same way that ordinary algebra describes numeric relations. | It is thus a formalism for describing logical relations in the same way that ordinary algebra describes numeric relations. | ||
Boolean algebra was introduced by George Boole in his first book ''The Mathematical Analysis of Logic'' (1847), and set forth more fully in his ''An Investigation of the Laws of Thought'' (1854). | Boolean algebra was introduced by George Boole in his first book ''The Mathematical Analysis of Logic'' (1847), and set forth more fully in his ''An Investigation of the Laws of Thought'' (1854). | ||
Line 15: | Line 7: | ||
According to Huntington, the term "Boolean algebra" was first suggested by Sheffer in 1913. | According to Huntington, the term "Boolean algebra" was first suggested by Sheffer in 1913. | ||
Boolean algebra has been fundamental in the development of digital electronics, and is provided for in all modern programming languages. | |||
It is also used in [[Set theory (nonfiction)|set theory]] and statistics. | |||
== In the News == | |||
= | <gallery mode="traditional"> | ||
</gallery> | |||
== Fiction cross-reference == | == Fiction cross-reference == | ||
* [[Gnomon algorithm]] | |||
== Nonfiction cross-reference == | |||
* [[Set theory (nonfiction)]] | |||
[[Category:Nonfiction (nonfiction)]] | [[Category:Nonfiction (nonfiction)]] | ||
[[Category:Logic (nonfiction)]] | [[Category:Logic (nonfiction)]] | ||
[[Category:Mathematics (nonfiction)]] | [[Category:Mathematics (nonfiction)]] |
Revision as of 16:21, 23 June 2016
In mathematics (nonfiction) and mathematical logic, Boolean algebra (or Boolean logic) is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively.
It is thus a formalism for describing logical relations in the same way that ordinary algebra describes numeric relations.
Boolean algebra was introduced by George Boole in his first book The Mathematical Analysis of Logic (1847), and set forth more fully in his An Investigation of the Laws of Thought (1854).
According to Huntington, the term "Boolean algebra" was first suggested by Sheffer in 1913.
Boolean algebra has been fundamental in the development of digital electronics, and is provided for in all modern programming languages.
It is also used in set theory and statistics.