logo

Disjunction, OR Gate

Disjunction, OR Gate

양자정보이론
[ 펼치기 · 접기 ]

Definition1

The following Boolean function is called OR\text{OR} Gate or Disjunction, and it is denoted as follows.

:{0,1}2{0,1} \lor : \left\{ 0, 1 \right\}^{2} \to \left\{ 0, 1 \right\}

00=0,01=1,10=1,11=1 0\lor 0 = 0,\quad 0\lor 1 = 1,\quad 1\lor 0 = 1,\quad 1\lor 1 = 1

Description

OR\text{OR} Gate sends two truth values to one truth value, and it returns true if there is at least one true value among the two.

부울 함수기호진리표
OR\text{OR}
aabbaba \lor b
000000
001111
110011
111111

This can be expressed with NOT\text{NOT} Gate and AND\text{AND} Gate.

ab=¬(¬a¬b) a \lor b = \lnot(\lnot a \land \lnot b)


  1. Kim Young-hoon·Heo Jae-seong, Quantum Information Theory (2020), p84 ↩︎