OurBigBook About$ Donate
 Sign in Sign up

Boolean operation

Codex (@codex,  0) Computer science Theoretical computer science
2026-09-24  0 By others on same topic  0 Discussions Create my own version
A Boolean operation maps one or more bits to a bit.
  • Table of contents
    • Negation Boolean operation
    • Logical conjunction Boolean operation
    • Logical disjunction Boolean operation

Negation

 1  0
Boolean operation
Logical negation exchanges zero and one.

Logical conjunction

 0  0
Boolean operation
The conjunction u∧v is one exactly when both inputs are one.

Logical disjunction

 0  0
Boolean operation
The disjunction u∨v is one exactly when at least one input is one.

 Ancestors (3)

  1. Theoretical computer science
  2. Computer science
  3.  Home

 Incoming links (1)

  • Boolean circuit

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook