commit 6e73822c904099994eb89a592bf48fdaacf49238
parent 3b0736b1bf65cee2291c7d5c60dd6ba84b40cca1
Author: Andrew <andrewlaack1@gmail.com>
Date: Sat, 17 Aug 2024 17:58:48 -0500
did discrete for 30 minutes
Diffstat:
4 files changed, 32 insertions(+), 1 deletion(-)
diff --git a/ConditionalDisjunction.md b/ConditionalDisjunction.md
@@ -0,0 +1,8 @@
+:discrete: :logic:
+# Conditional Disjunction
+
+1.3.2
+
+## Notes
+
+**Definition:** The conditional disjunction rule states $p \to q \equiv \neg p \vee q$.
diff --git a/DiscreteMath.md b/DiscreteMath.md
@@ -24,4 +24,7 @@ Unit 1.3:
- [[Tautology.md]] - Always true - use the symbol t
- [[Contradiction.md]] - Always false
- [[Contingency.md]] - Must be evaluated
- - [[DemorgansLaw.md]]
+ - [[DemorgansLaw.md]] - Two laws describing negation of and/or compound propositions
+ - [[ConditionalDisjunction.md]]
+ - [[DistributiveLaw.md]]
+ - [[WellDefined.md]]
diff --git a/DistributiveLaw.md b/DistributiveLaw.md
@@ -0,0 +1,12 @@
+:logic: :discrete:
+# Distributive Law
+
+1.3.2
+
+## Notes
+
+**Definition:** The distributive law of disjunction states $p \vee (q \wedge r) \equiv (p\vee q) \wedge (p \vee r)$.
+
+This can be thought of as being something or two other things. By this logic, we can then state it as the thing or one of the others and the thing or the second other.
+
+Either q and r or p must be true.
diff --git a/WellDefined.md b/WellDefined.md
@@ -0,0 +1,8 @@
+:discrete: :math: :logic:
+# Well Defined
+
+1.3.2
+
+## Notes
+
+**Definition:** For an object to be well defined it must be unambiguous.