From c77bbc3d0bb4ecab44aab203ff2937250d9fbe18 Mon Sep 17 00:00:00 2001 From: thomasabishop Date: Mon, 9 Jan 2023 07:30:07 +0000 Subject: [PATCH] Autosave: 2023-01-09 07:30:07 --- Electronics_and_Hardware/Digital_circuits/Logic_gates.md | 2 +- Logic/Laws_and_theorems.md/DeMorgan's_Laws.md | 4 +--- 2 files changed, 2 insertions(+), 4 deletions(-) diff --git a/Electronics_and_Hardware/Digital_circuits/Logic_gates.md b/Electronics_and_Hardware/Digital_circuits/Logic_gates.md index c5f2a11..9a99440 100644 --- a/Electronics_and_Hardware/Digital_circuits/Logic_gates.md +++ b/Electronics_and_Hardware/Digital_circuits/Logic_gates.md @@ -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 diff --git a/Logic/Laws_and_theorems.md/DeMorgan's_Laws.md b/Logic/Laws_and_theorems.md/DeMorgan's_Laws.md index bfd252a..78990c1 100644 --- a/Logic/Laws_and_theorems.md/DeMorgan's_Laws.md +++ b/Logic/Laws_and_theorems.md/DeMorgan's_Laws.md @@ -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.