Digital logic-logical operations (understand AND OR operation)

The basic logical operations are not difficult to understand, but I think that memory is a more efficient way to use it, and I am familiar with it.

logic operation

• 与 $$A\cdot 1=A$$ $$A\cdot 0=0$$
• Or $$A+0=A$$ $$A+1=1$$
• non-
• And not (and then not) $$\overline{A\cdot 1}=\bar{A}$$ $$\overline{A\cdot 0}=1$$
• Or not (present or not) $$\overline{A+0}=\bar{A}$$ $$\overline{A+1}=0$$
• XOR $$A\oplus 1=\bar{A}$$ $$A\oplus 0=A$$
• Same OR $$A\oplus 0=\bar{A}$$ $$A\oplus 1=A$$

The essence of XOR is: $$A\oplus B=\bar{A}B+B\stackrel{ˉThe}{A}$$
same or the most essential is:$$A\odot B=\bar{A}\bar{B}+BA$$

The following is a deformed formula, you can pass the most basic formula deformation verification

XOR: $$\bar{A}\oplus \bar{B}$$ $$\bar{A}\odot B$$ $$A\odot \bar{B}$$

Same or: $$\bar{A}\oplus B$$ $$A\oplus \bar{B}$$ $$\bar{A}\odot \bar{B}$$

Boolean algebra

The part of Boolean algebra is repeated with discrete mathematics.
Some theorems of Boolean algebra are basically the same as discrete mathematics, so skip it.