Boolean Algebra (negation quickie)

In summary, Boolean Algebra is a mathematical system consisting of two values, True and False, and logical operators such as AND, OR, and NOT. Negation, also known as complement or inversion, is an operation that changes the value of an input in Boolean Algebra. A quickie in Boolean Algebra refers to the process of applying negation to a Boolean expression. The purpose of negation is to create the logical complement of a given value or expression. It is represented by the symbols "¬" or "~" and is placed before the input or expression being negated.
  • #1
sunrah
199
22
is this a valid statement

[itex]\overline{A\overline{B}} = \overline{A}B[/itex]
 
Physics news on Phys.org
  • #2
Doesn't look valid. Verify using Truth Table.
 
  • #3
I seem to recall a rule something like not(AB) = A' + B' and not(A+B) = A'B'

Don't remember the name however.
 

What is Boolean Algebra?

Boolean Algebra is a mathematical system used for logical operations and is named after mathematician George Boole. It consists of only two values, True (represented by 1) and False (represented by 0), and uses logical operators such as AND, OR, and NOT to manipulate these values.

What is negation in Boolean Algebra?

Negation, also known as complement or inversion, is an operation in Boolean Algebra that changes the value of an input. It takes a single input and produces the opposite value. For example, the negation of True is False, and the negation of False is True.

What is a quickie in Boolean Algebra?

A quickie in Boolean Algebra refers to the process of applying negation to a Boolean expression. This involves changing all True values to False and vice versa, as well as applying the negation operation to any logical operators within the expression.

What is the purpose of negation in Boolean Algebra?

Negation is used in Boolean Algebra to create the logical complement of a given value or expression. This is helpful in simplifying complex logical expressions and in creating truth tables to determine the validity of logical arguments.

How is negation represented in Boolean Algebra?

Negation is represented by the symbol "¬" or the tilde "~" and is placed before the input or expression being negated. For example, the negation of A would be written as ¬A or ~A.

Similar threads

  • Introductory Physics Homework Help
Replies
7
Views
983
  • Introductory Physics Homework Help
Replies
9
Views
1K
  • Introductory Physics Homework Help
Replies
3
Views
1K
  • Introductory Physics Homework Help
Replies
10
Views
840
  • Calculus and Beyond Homework Help
Replies
7
Views
889
  • Introductory Physics Homework Help
Replies
8
Views
2K
  • Calculus and Beyond Homework Help
Replies
10
Views
238
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
1K
Replies
1
Views
326
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
1K
Back
Top