Word | Meaning | 中文 |
Digital Logic Systems | 数字逻辑系统 | |
Logic Gate | ( also gate ) ( computing 计) an electronic switch that reacts in one of two ways to data that is put into it. A computer performs operations by passing data through a very large number of logic gates . | [计][电子] 逻辑门 |
integrated circuit | a small microchip that contains a large number of electrical connections and performs the same function as a larger circuit made from separate parts | [电子] 集成电路 |
NOT Gate | Whenthe input is LOW the output is HIGH and when the input is HIGH the output is LOW.
| 非门 |
AND Gate | HIGH if all of the inputs are HIGH, LOW in all other cases. | 与门 |
NAND Gate | A NAND gate is a NOT AND gate
| 与非门 |
OR Gate | LOW if all of the inputs are LOW, HIGH if any of the inputs are HIGH.
| 或门 |
NOR Gate | A NOR gate is a NOT OR gate | 或非门 |
XOR Gates | XOR: HIGH if one input or another input (not both) is high. | 异或门 |
XNOR Gates | XNOR = NOT XOR | 同或门 |
Combinational Logic | [数] 组合逻辑电路 | |
Boolean expression | In computer science, a Boolean expression is an expression in a programming language that produces a Boolean value when evaluated, i.e. one of true or false. A Boolean expression may be composed of a combination of the Boolean constants true or false, Boolean-typed variables, Boolean-valued operators, and Boolean-valued functions.[1] Boolean expressions correspond to propositional formulas in logic and are a special case ofBoolean circuits.[2] | 布尔表达式 |
Boolean Algebra | a system of symbolic logic devised by George Boole; used in computers | [数][计] 布尔代数 |
Logical Inverse | 逻辑规则 | |
Involution |
| 复原率 |
dominance | A+ 1=1;A+ 0 = A A· 1 =A; A· 0= 0
| 0-1律 |
indentify | A+0=a ;A•1=1 | 自等律 |
Idempotence | A · A = A;A+ A = A | 重叠率 |
Complementary |
| 互补率 |
commutativity
| A B = BA;A+ B = B+ A | 交换律 |
associativity
| A (BC) =( AB)C;A +(B+C) =( A+B)+C | 结合律 |
distributivity
| A(B+C)=AB+AC;A+BC=(A+B) · (A+C) | 分配率 |
absorption
| A(A+B) =A;A+AB =A | 吸收率 |
demorgan
|
| 反演律(摩根定律) |

