Boolean algebra is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of multiplication xy, addition x + y, and negation −x replaced by the respective logical operations of conjunction x∧y, disjunction x∨y, and complement ¬x.
| Attributes | Values |
|---|
| rdfs:label
| |
| rdfs:comment
| - Boolean algebra is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of multiplication xy, addition x + y, and negation −x replaced by the respective logical operations of conjunction x∧y, disjunction x∨y, and complement ¬x.
- Boolean algebra is a branch of algebra concerned with variables whose values are truth values, true and false, usually denoted with the integers 0 and 1 respectively. The set of these truth values is known as a boolean domain. The Boolean domain acts the same way as the two-element set Integer Modulo 2. Boolean algebra is named after George Boole. The basic operations of Boolean algebra are Conjunction (), Disjunction (), and Negation (). The operations can be defined as: where . They can also be defined using a table called a truth table:
- Boolean algebra(also known as Boolean logic) is a mathematical model for the operations of digital electronics. It consists of three basic operations known as AND, OR, and NOT.
|
| sameAs
| |
| dcterms:subject
| |
| dbkwik:itlaw/prope...iPageUsesTemplate
| |
| abstract
| - Boolean algebra is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of multiplication xy, addition x + y, and negation −x replaced by the respective logical operations of conjunction x∧y, disjunction x∨y, and complement ¬x.
- Boolean algebra is a branch of algebra concerned with variables whose values are truth values, true and false, usually denoted with the integers 0 and 1 respectively. The set of these truth values is known as a boolean domain. The Boolean domain acts the same way as the two-element set Integer Modulo 2. Boolean algebra is named after George Boole. The basic operations of Boolean algebra are Conjunction (), Disjunction (), and Negation (). The operations can be defined as: where . They can also be defined using a table called a truth table:
- Boolean algebra(also known as Boolean logic) is a mathematical model for the operations of digital electronics. It consists of three basic operations known as AND, OR, and NOT.
|
![[RDF Data]](/fct/images/sw-rdf-blue.png)