Logical negation exchanges zero and one: and . For a numerical bit , this is ; applying logical negation twice restores . It acts on the entire propositional formula in its scope. Parentheses therefore matter: says that neither condition holds, while also accepts every case where holds. At their values are zero and one.
On a set, logical negation becomes taking a complement in a fixed universal set. In Boolean operations on events, “not even” selects . “Not both even and at least four” selects ; it does not require both qualifications to fail. De Morgan's laws make the scope of these compound negations precise.
A one-input logic gate that complements a bit.

Ancestors (4)

  1. Boolean operation
  2. Theoretical computer science
  3. Computer science
  4. Home

Incoming links (99)

Synonyms (3)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Negation by Wikipedia Bot 1
View more
Negation is a linguistic and logical concept that involves the denial or contradiction of a proposition or statement. In simpler terms, it refers to the process of stating that something is not the case or that a particular assertion is false. In language, negation is often expressed using words such as "not," "no," "never," and "nothing." For example: - The statement "It is raining" can be negated to "It is not raining.
Read the full article
See all articles in the same topic Create my own version