Ad
related to: boolean algebra founder theory
Search results
Results From The WOW.Com Content Network
He contributed to the theory of linear differential equations and the study of the sum of residues of a rational function. In 1847, Boole developed Boolean algebra, a fundamental concept in binary logic, which laid the groundwork for the algebra of logic tradition and forms the foundation of digital circuit design and modern computer science.
The term "Boolean algebra" honors George Boole (1815–1864), a self-educated English mathematician. He introduced the algebraic system initially in a small pamphlet, The Mathematical Analysis of Logic, published in 1847 in response to an ongoing public controversy between Augustus De Morgan and William Hamilton, and later as a more substantial book, The Laws of Thought, published in 1854.
All concrete Boolean algebras satisfy the laws (by proof rather than fiat), whence every concrete Boolean algebra is a Boolean algebra according to our definitions. This axiomatic definition of a Boolean algebra as a set and certain operations satisfying certain laws or axioms by fiat is entirely analogous to the abstract definitions of group ...
Boolean algebra is a mathematically rich branch of abstract algebra. Stanford Encyclopaedia of Philosophy defines Boolean algebra as 'the algebra of two-valued logic with only sentential connectives, or equivalently of algebras of sets under union and complementation.' [1] Just as group theory deals with groups, and linear algebra with vector spaces, Boolean algebras are models of the ...
A timeline of mathematical logic ; see also history of logic. 19th century 1847 – George Boole proposes symbolic logic in The Mathematical Analysis of Logic, defining what is now called Boolean algebra. 1854 – George Boole perfects his ideas, with the publication of An Investigation of the Laws of Thought. 1874 – Georg Cantor proves that the set of all real numbers is uncountably ...
Therefore, algebras on Boole's account cannot be interpreted by sets under the operations of union, intersection and complement, as is the case with modern Boolean algebra. The task of developing the modern account of Boolean algebra fell to Boole's successors in the tradition of algebraic logic ( Jevons 1869, Peirce 1880, Jevons 1890 ...
A revolutionary work for switching circuit theory, Shannon diagramed switching circuits that could implement the essential operators of Boolean algebra. Then he proved that his switching circuits could be used to simplify the arrangement of the electromechanical relays that were used during that time in telephone call routing switches .
The method of forcing is employed in set theory, model theory, and recursion theory, as well as in the study of intuitionistic mathematics. The mathematical field of category theory uses many formal axiomatic methods, and includes the study of categorical logic , but category theory is not ordinarily considered a subfield of mathematical logic.