summary refs log tree commit diff stats
path: root/src/org/uni_notes
diff options
context:
space:
mode:
authorCrystal <crystal@wizard.tower>2023-10-16 21:52:20 +0100
committerCrystal <crystal@wizard.tower>2023-10-16 21:52:20 +0100
commitb815e39fc6ce94155b66f7e536fbc2b64294628b (patch)
tree5febbe8303a35e6b044a7d090411a5d70f2d5b72 /src/org/uni_notes
parenta565af2ec831e21dc4cd38911cbbdefc7387320b (diff)
downloadwww-b815e39fc6ce94155b66f7e536fbc2b64294628b.tar.gz
Finally, an update
Diffstat (limited to 'src/org/uni_notes')
-rwxr-xr-xsrc/org/uni_notes/algebra1.org4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/org/uni_notes/algebra1.org b/src/org/uni_notes/algebra1.org
index 4afc389..1126423 100755
--- a/src/org/uni_notes/algebra1.org
+++ b/src/org/uni_notes/algebra1.org
@@ -150,7 +150,7 @@ not(*P ∨ Q*) ⇔ P̅ ∧ Q̅
 *A rule I really like to use here is: Break and Invert. Basically you break the bar into the three characters of the propositions, so you get not(P) not(∧ or ∨) /NOT AN ACTUAL MATH WRITING. DONT USE IT ANYWHERE ELSE OTHER THAN YOUR BRAIN/ and not(Q)*
 
 *** *Transitivity*:
-[(P ⇒ Q) (Q ⇒ R)] ⇔ P ⇒ R
+[(P ⇒ Q) AND (Q ⇒ R)] ⇔ P ⇒ R
 
 *** *Contraposition*:
 (P ⇒ Q) ⇔ (Q̅ ⇒ P̅)
@@ -162,7 +162,7 @@ not(*P ∨ Q*) ⇔ P̅ ∧ Q̅
 
 and
 
-(Q̅ ⇒ Q) is true
+(P̅ ⇒ Q) is true
 
 then