Autosave: 2023-01-09 07:30:07
This commit is contained in:
parent
dcb4276379
commit
c77bbc3d0b
2 changed files with 2 additions and 4 deletions
|
@ -101,7 +101,7 @@ NAND is a **universal logic gate**: equipped with just a NAND we can represent e
|
|||
|
||||
## OR gate
|
||||
|
||||
> The OR gate represents the truth conditions of the [disjunction](/Logic/Truth-functional_connectives.md#disjunction) truth functional connective
|
||||
> The OR gate represents the truth conditions of the [disjunction](/Logic/Truth-functional_connectives### Truth conditions.md#disjunction) truth functional connective
|
||||
|
||||
### Symbol
|
||||
|
||||
|
|
|
@ -23,9 +23,7 @@ The equivalence is demonstrated with the following truth-table
|
|||
| T | T | F | F |
|
||||
| T | F | T | T |
|
||||
| F | T | T | T |
|
||||
| F | F | T | T |
|
||||
|
||||
## Second Law
|
||||
| F | F | T | T ### Truth conditions |
|
||||
|
||||
> The negation of a disjunction is equivalent to the conjunction of the negation of the original disjuncts.
|
||||
|
||||
|
|
Loading…
Add table
Reference in a new issue