LOGICANDALGEBRAOFSETS.PDFVIP

Queuing Theory. Preliminaries P1 1 Course coordinator: Armin Halilovic LOGIC AND ALGEBRA OF SETS 1.1 LOGIC Connectives Conjunction P ∧Q P and Q Disjunction P ∨Q P or Q Implication P ⇒Q If P then Q Equivalence P ⇔Q P if and only if Q Negation ¬P Not P Truth tables ( F= false, T=true ) P Q P ∧Q P ∨Q P ⇒Q P ⇔Q T T T T T T T F F T F F F T F T T F F F F F T T Negation P ¬P T F F T _ Exclusive OR is denoted ∨ . _ P ∨Q is true if either P or Q, but not both are true, as vi see in the truth table: P Q _ P ∨Q T T F T F T F T T F F F Quantifiers Universal quantifier ∀x For all x Existential quantifier ∃x There exists an x such that Some formulas 1.¬(¬P) P 2. P ∧P P 3. P ∨P P 4. P ∧(¬P) F 5. P ∨(¬P) T 6. P ∧Q Q ∧P Commutative laws P ∨Q Q ∨P Queuing Theory. Preliminaries P1 2 Course coordinator: Armin Halilovic 7. (P ∧Q) ∧R P ∧(Q ∧R) Associative laws (P ∨Q) ∨R P ∨(Q ∨R) P (Q R) (P Q) ∨(P ∧R) 8. ∧ ∨ ∧ Distributive laws P ∨(Q ∧R) (P ∨Q) ∧(P ∨R) 9. ¬(P ∧Q) (¬P) ∨(¬Q) De Morgan’s laws ¬(P ∨Q) (¬P) ∧(¬Q) ( ) ( ) ( )