Fundamentals of Computer Science - Week 2 Summary - Part 1 out of 2

Propositional Equivalences

* Two formulas are equivalent when they have the same truth tables
* We denote equivalence by ≡
* A ≡ B means that A and B always have the same truth values, regardless of how the variables are assigned.
* Note that ≡ is a relation and NOT a connective

De Morgan's Laws

¬(p∧q)≡¬p∨¬q 
¬(p∨q)≡¬p∧¬q

It is similar to the process of algebra when you have a negative before a parenthesis. First law tells us also that the connective also changes.


Comments

Popular posts from this blog

syllabus: Algorithms and Data Structures 1 [CM1035]

syllabus: Fundamentals of Computer Science [CM1025]

Introduction to Programming - Week 1 and 2 Summary