Boolean logic: Difference between revisions

Revision as of 17:42, 20 January 2011

Revision as of 18:38, 20 January 2011

Line 1:

{{Original research|date=August 2010}}

{{Merge to|Introduction to Boolean algebra|date=February 2010}}

'''Boolean logic''' is a complete [[formal system|system]] for [[logic]]al [[operation (mathematics)|operation]]s, used inoften manysince systems{{Clarify|date=Septemberpopularization 2010}}of [[mathematical logic]] and discussions concerning the [[foundations of mathematics]]. It was named after [[George Boole]], who first defined an [[algebraic structure|algebraic system]] of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the basis of all modern [[digital electronics]]. In 1938, [[Claude Elwood Shannon|Claude Shannon]] showed how electric circuits with relays could be modeled with Boolean logic. This fact soon proved enormously consequential with the emergence of the electronic [[computer]].

''Using the [[algebra of sets]], this article contains a basic introduction to [[Set (mathematics)|sets]], Boolean operations, [[Venn diagram]]s, [[truth tables]], and Boolean applications. The [[Boolean algebra (structure)]] article discusses a type of algebraic structure that satisfies the axioms of Boolean logic. The [[binary arithmetic]] article discusses the use of [[binary numeral system|binary]] numbers in computer systems.''