# Logic Operation

Jump to navigation
Jump to search

A Logic Operation is a mathematical operation that can be used to create a logic sentence / logic argument.

**AKA:**Logic Operator.**Context:**- It can be a part of a Logic System.
- It can be referenced by a Reasoning Step.
- It can range from being a Deductive Logic Operation (such as Modus Ponens and Modus Tollens) to being an Inductive Logic Operation to being an Abductive Logic Operation.
- It can be a Logical Negation.
- It can range from being a Commutativity Operation to being an Associativity Operation to being a Distributivity Operation.
- It can be a part of a Logic Operation Set.
- ...

**Example(s):****Counter-Example(s):****See:**Logical Connective, Existential Quantification, Universal Quantification, Mathematical Logic, Abstract Algebra.

## References

### 2016

- (Wikipedia, 2016) ⇒ https://en.wikipedia.org/wiki/Boolean_algebra Retrieved:2016-6-22.
- In mathematics and mathematical logic,
**Boolean algebra**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. Instead of elementary algebra where the values of the variables are numbers, and the main operations are addition and multiplication, the main operations of Boolean algebra are the conjunction*and*, denoted ∧, the disjunction*or*, denoted ∨, and the negation*not*, denoted ¬. 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.^{[1]}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.

- In mathematics and mathematical logic,

- ↑ "The name Boolean algebra (or Boolean 'algebras') for the calculus originated by Boole, extended by Schröder, and perfected by Whitehead seems to have been first suggested by Sheffer, in 1913." E. V. Huntington, "New sets of independent postulates for the algebra of logic, with special reference to Whitehead and Russell's
*Principia mathematica*", in*Trans. Amer. Math. Soc.***35**(1933), 274-304; footnote, page 278.

### 2009

- wordnet.princeton.edu/perl/webwn
- QUOTE: an operation that follows the rules of symbolic logic