tautologies
play

Tautologies Definition Formula is a tautology if v | = holds for - PowerPoint PPT Presentation

Mar 24, 2024 •102 likes •1.24k views

Tautologies Definition Formula is a tautology if v | = holds for every truth valuation v (i.e., if is true in every valuation). Example: If it is raining, then it is raining. p p Example: It is Friday today, or it is not

  1. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 0 ϕ ψ ϕ ∨ ψ ∨ 0 0 0 0 1 1 1 0 1 0 0 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  2. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ ∨ ψ ∨ 0 0 0 0 1 1 1 0 1 0 ? 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  3. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ ∨ ψ ∨ 0 0 0 0 1 1 1 0 1 0 1 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  4. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): ? ϕ ψ ϕ → ψ → 0 0 1 0 1 1 1 0 0 0 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  5. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ → ψ → 0 0 1 0 1 1 1 0 0 0 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  6. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): ? ϕ ψ ϕ → ψ → 0 0 1 0 1 1 1 0 0 1 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  7. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ → ψ → 0 0 1 0 1 1 1 0 0 1 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  8. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 0 ϕ ψ ϕ → ψ → 0 0 1 0 1 1 1 0 0 ? ? 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  9. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 0 ϕ ψ ϕ → ψ → 0 0 1 0 1 1 1 0 0 1 0 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  10. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ → ψ → 0 0 1 0 1 1 1 0 0 1 ? 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  11. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ → ψ → 0 0 1 0 1 1 1 0 0 1 1 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  12. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ → ψ → 0 0 1 0 1 1 1 0 0 ? 0 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  13. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ → ψ → 0 0 1 0 1 1 1 0 0 0 0 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  14. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ ↔ ψ ↔ 0 0 1 0 1 0 1 0 0 0 ? 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  15. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ ↔ ψ ↔ 0 0 1 0 1 0 1 0 0 0 0 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  16. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ ↔ ψ ↔ 0 0 1 0 1 0 1 0 0 1 ? 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  17. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ ↔ ψ ↔ 0 0 1 0 1 0 1 0 0 1 1 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  18. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ ↔ ψ ↔ 0 0 1 0 1 0 1 0 0 ? 0 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  19. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 1 ϕ ψ ϕ ↔ ψ ↔ 0 0 1 0 1 0 1 0 0 0 0 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  20. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 0 ϕ ψ ϕ ↔ ψ ↔ 0 0 1 0 1 0 1 0 0 1 ? 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  21. Truth Valuations If some values were already assigned to some nodes, this assignment can impose some constraints on values that can be assigned to other nodes. Examples where some previously assigned values enforce some particular value at some other node (resp. nodes): 0 ϕ ψ ϕ ↔ ψ ↔ 0 0 1 0 1 0 1 0 0 1 0 1 1 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 12 / 54

  22. Is a given formula a tautology? Example: ϕ 1 := ( p → ( q ∨ r )) ∨ ( p → r ) ∨ → → ∨ p q p r r Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 13 / 54

  23. Is a given formula a tautology? Example: ϕ 1 := ( p → ( q ∨ r )) ∨ ( p → r ) ∨ → → ∨ p q r Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 13 / 54

  24. Is a given formula a tautology? Example: ϕ 1 := ( p → ( q ∨ r )) ∨ ( p → r ) 0 ∨ → → ∨ p q r Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 13 / 54

  25. Is a given formula a tautology? Example: ϕ 1 := ( p → ( q ∨ r )) ∨ ( p → r ) 0 ∨ 0 0 → → ∨ p q r Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 13 / 54

  26. Is a given formula a tautology? Example: ϕ 1 := ( p → ( q ∨ r )) ∨ ( p → r ) 0 ∨ 0 0 → → 0 ∨ p q r 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 13 / 54

  27. Is a given formula a tautology? Example: ϕ 1 := ( p → ( q ∨ r )) ∨ ( p → r ) 0 ∨ 0 0 → → 0 ∨ p q r 1 0 0 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 13 / 54

  28. Is a given formula a tautology? Example: ϕ 1 := ( p → ( q ∨ r )) ∨ ( p → r ) 0 ∨ 0 0 → → 0 ∨ p q r 1 0 0 Formula ϕ 1 is not a tautology — it is false in valuation v where v ( p ) = 1, v ( q ) = 0, v ( r ) = 0. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 13 / 54

  29. Is a given formula a tautology? Example: ϕ 2 := ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) → ↔ → ∨ ¬ ¬ p q r Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 14 / 54

  30. Is a given formula a tautology? Example: ϕ 2 := ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) 0 → ↔ → ∨ ¬ ¬ p q r Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 14 / 54

  31. Is a given formula a tautology? Example: ϕ 2 := ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) 0 → 1 ↔ 0 → ∨ ¬ ¬ p q r Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 14 / 54

  32. Is a given formula a tautology? Example: ϕ 2 := ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) 0 → 1 ↔ 0 → ∨ 1 ¬ ¬ p q r 0 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 14 / 54

  33. Is a given formula a tautology? Example: ϕ 2 := ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) 0 → 1 ↔ 0 → ∨ 1 ¬ ¬ p q r 0 0 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 14 / 54

  34. Is a given formula a tautology? Example: ϕ 2 := ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) 0 → 1 ↔ 0 → ∨ 1 1 ¬ ¬ p q r 0 0 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 14 / 54

  35. Is a given formula a tautology? Example: ϕ 2 := ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) 0 → 1 ↔ 0 1 → ∨ 1 1 ¬ ¬ p q r 0 0 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 14 / 54

  36. Is a given formula a tautology? Example: ϕ 2 := ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) 0 → 1 ↔ 0 1,0 → ∨ 1 1 ¬ ¬ p q r 0 0 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 14 / 54

  37. Is a given formula a tautology? Example: ϕ 2 := ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) 0 → 1 ↔ 0 1,0 – contradition → ∨ 1 1 ¬ ¬ p q r 0 0 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 14 / 54

  38. Is a given formula a tautology? Example: ϕ 2 := ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) 0 → 1 ↔ 0 1,0 – contradition → ∨ 1 1 ¬ ¬ p q r 0 0 Formula ϕ 2 is a tautology. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 14 / 54

  39. Semantic Contradiction Semantic contradition — the case when we find out that in a valuation with the given property we are looking for (e.g., a valuation where a given formula is false), some formula should be true and false at the same time. There could not exist a valuation where some formula would be true and false at the same time. This way we can justify for example that a given formula is a tautology (and so always true), because by finding a semantic contradiction we show there can not exist a valuation where this formula is false. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 15 / 54

  40. Is a given formula a tautology? The approach from the previous example can described by the following sequnce of arguments: 1. Let us assume that ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) is false. Then: 2. p ↔ ( ¬ q ∨ r ) is true - it follows from 1. 3. ¬ p → q is false - it follows from 1. 4. ¬ p is true - it follows from 3. 5. q is false - it follows from 3. 6. p is false - it follows from 4. 7. ¬ q is true - it follows from 5. 8. ¬ q ∨ r is true - it follows from 7. 9. ¬ q ∨ r is false - it follows from 2. a 6. 10. It is not possible that ( p ↔ ( ¬ q ∨ r )) → ( ¬ p → q ) is false because if it would be so, ¬ q ∨ r would have to be true and false at the same time in this case (see 8. a 9.). Remark: Note that in this justification the graph representing the given formula is not mentioned at all. We talk there only about truth and falsity of subformulas of this formula. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 16 / 54

  41. Is a given formula a tautology? It is not always the case that values that could be assigned to some nodes are uniquely determined by values previously assigned to some other nodes. When we are in a situation where it is not possible to assign a unique value to a node, it is necessary to try several possibilities. We choose some node and a value assigned to it. Then possibly some values that must be assigned to some other nodes are determined. If we do not succeed in finding a valuation we are looking for, we must backtrack, assign a diffent value to the given node, and try this new possibility. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 17 / 54

  42. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) ∨ ∧ ∨ ∧ ∧ ¬ ¬ p q Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  43. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ ∧ ∨ ∧ ∧ ¬ ¬ p q Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  44. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ ∧ ∧ ¬ ¬ p q Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  45. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ 0 0 ∧ ∧ ¬ ¬ p q Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  46. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ 0 0 ∧ ∧ ¬ ¬ p q 0 We try to assign value zero to node p . Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  47. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ 0 0 ∧ ∧ 1 ¬ ¬ p q 0 We try to assign value zero to node p . Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  48. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ 0 0 ∧ ∧ 1 ¬ 0 ¬ p q 0 We try to assign value zero to node p . Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  49. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ 0 0 ∧ ∧ 1 ¬ 0 ¬ p q 0 1 We try to assign value zero to node p . Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  50. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0,1 0 ∧ ∨ 0 0 ∧ ∧ 1 ¬ 0 ¬ p q 0 1 We try to assign value zero to node p . Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  51. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0,1 – contradiction 0 ∧ ∨ 0 0 ∧ ∧ 1 ¬ 0 ¬ p q 0 1 We try to assign value zero to node p . Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  52. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ 0 0 ∧ ∧ ¬ ¬ p q 1 So node p must have value 1. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  53. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ 0 0 ∧ ∧ 0 ¬ ¬ p q 1 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  54. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ 0 0 ∧ ∧ 0 ¬ ¬ p q 1 0 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  55. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ 0 0 ∧ ∧ 0 ¬ 1 ¬ p q 1 0 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  56. Is a given formula a tautology? Example: ϕ 3 := (( p ∧ q ) ∨ ( ¬ p ∧ ¬ q )) ∨ ( ¬ p ∧ q ) 0 ∨ 0 0 ∧ ∨ 0 0 ∧ ∧ 0 ¬ 1 ¬ p q 1 0 Formula ϕ 3 is not a tautology — it is false in valuation v where v ( p ) = 1, v ( q ) = 0. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 18 / 54

  57. Equivalence of Formulas Definition Formulas ϕ and ψ are logically equivalent if for each truth valuation v it holds that ϕ and ψ have the same truth value in valuation v , i.e., v | = ϕ iff v | = ψ . The fact that formulas ϕ and ψ are logically equivalent is denoted ϕ ⇔ ψ . Formulas ϕ and ψ are logically equivalent iff ϕ ↔ ψ is a tautology. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 19 / 54

  58. Equivalence of Formulas Example: ¬ ( p → q ) ⇔ p ∧ ¬ q p q p → q ¬ ( p → q ) ¬ q p ∧ ¬ q 0 0 1 0 1 0 0 1 1 0 0 0 1 0 0 1 1 1 1 1 1 0 0 0 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 20 / 54

  59. Equivalence of Formulas To show that formulas ϕ and ψ are not equivalent, it is sufficient to find a valuation v such that: v | = ϕ and v � | = ψ , or v � | = ϕ and v | = ψ . Example: p ∨ ( q ∧ r ) is not equivalent to ( p ∨ q ) ∧ r Valuation v , where: v ( p ) = 1 v ( q ) = 1 v ( r ) = 0 In this valuation, p ∨ ( q ∧ r ) holds but ( p ∨ q ) ∧ r does not hold. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 21 / 54

  60. Some Important Equivalences – Equivalences for negation: ¬¬ p ⇔ p double negation – Equivalences for conjunction: ( p ∧ q ) ∧ r ⇔ p ∧ ( q ∧ r ) associativity p ∧ q ⇔ q ∧ p commutativity p ∧ p ⇔ p idempotence – Equivalences for disjunction: ( p ∨ q ) ∨ r ⇔ p ∨ ( q ∨ r ) associativity p ∨ q ⇔ q ∨ p commutativity p ∨ p ⇔ p idempotence Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 22 / 54

  61. Some Important Equivalences – Distributivity of ∧ and ∨ : p ∧ ( q ∨ r ) ⇔ ( p ∧ q ) ∨ ( p ∧ r ) p ∨ ( q ∧ r ) ⇔ ( p ∨ q ) ∧ ( p ∨ r ) – De Morgan’s laws: ¬ ( p ∧ q ) ⇔ ¬ p ∨ ¬ q ¬ ( p ∨ q ) ⇔ ¬ p ∧ ¬ q – Equivalences for implication: p → q ⇔ ¬ p ∨ q ¬ ( p → q ) ⇔ p ∧ ¬ q Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 23 / 54

  62. Some Important Equivalences – Equivalences for ↔ : ( p ↔ q ) ↔ r ⇔ p ↔ ( q ↔ r ) associativity p ↔ q ⇔ q ↔ p commutativity p ↔ q ⇔ ( p → q ) ∧ ( q → p ) p ↔ q ⇔ ( p ∨ ¬ q ) ∧ ( ¬ p ∨ q ) p ↔ q ⇔ ( p ∧ q ) ∨ ( ¬ p ∧ ¬ q ) Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 24 / 54

  63. Equivalence of Formulas Let us assume that formulas ϕ and ψ are logically equivalent, i.e., ϕ ⇔ ψ . If we replace atomic propositions in ϕ and ψ by arbitrary formulas, we obtain again a pair of equivalent formulas. Example: ¬ ( p ∨ q ) ⇔ ¬ p ∧ ¬ q Therefore, for arbitrary formulas χ 1 and χ 2 is ¬ ( χ 1 ∨ χ 2 ) ⇔ ¬ χ 1 ∧ ¬ χ 2 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 25 / 54

  64. Equivalence of Formulas ¬ ( p ∨ q ) ⇔ ¬ p ∧ ¬ q Replacement of atomic propositions: p replaced by q ∨ ¬ ( r → ¬ s ) q replaced by ¬ ( q ↔ p ) We obtain ¬ (( q ∨ ¬ ( r → ¬ s )) ∨ ¬ ( q ↔ p )) ⇔ ¬ ( q ∨ ¬ ( r → ¬ s )) ∧ ¬¬ ( q ↔ p ) Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 26 / 54

  65. Equivalence of Formulas Let us assume that ϕ is a formula and ψ its subformula. If we replace some occurrence of subformula ψ in formula ϕ with a formula ψ ′ such that ψ ⇔ ψ ′ , we obtain a formula ϕ ′ such that ϕ ⇔ ϕ ′ . Example: In formula ¬ (( p → q ) ∨ ( ¬ ( p → q ) → r )) we replace the second occurrence of subformula p → q with an equivalent formula ¬ p ∨ q . We obtain ¬ (( p → q ) ∨ ( ¬ ( ¬ p ∨ q ) → r )) Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 27 / 54

  66. Equivalent Transformations For arbitrary formulas ϕ , ψ , and χ , it holds: ϕ ⇔ ϕ . If ϕ ⇔ ψ , then ψ ⇔ ϕ . If ϕ ⇔ ψ and ψ ⇔ χ , then ϕ ⇔ χ . When we try to prove equivalence of formulas, we can proceed by smaller steps: For example, if it holds that ϕ 1 ⇔ ϕ 2 , ϕ 2 ⇔ ϕ 3 , ϕ 3 ⇔ ϕ 4 , and ϕ 4 ⇔ ϕ 5 , we can conclude that ϕ 1 ⇔ ϕ 5 . This can be written as ϕ 1 ⇔ ϕ 2 ⇔ ϕ 3 ⇔ ϕ 4 ⇔ ϕ 5 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 28 / 54

  67. Equivalent Transformations Example: The proof that ( p ∧ q ) → r ⇔ p → ( q → r ) ( p ∧ q ) → r ⇔ ¬ ( p ∧ q ) ∨ r ⇔ ( ¬ p ∨ ¬ q ) ∨ r ⇔ ¬ p ∨ ( ¬ q ∨ r ) ⇔ ¬ p ∨ ( q → r ) ⇔ p → ( q → r ) Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 29 / 54

  68. Equivalent Transformations Every formula can be transformed to an equivalent formula that uses only “ ¬ ”, “ ∧ ”, and “ ∨ ” as logical connectives. The connective “ ↔ ” can be replaced by other connectives using the following equivalences: p ↔ q ⇔ ( p → q ) ∧ ( q → p ) p ↔ q ⇔ ( p ∨ ¬ q ) ∧ ( ¬ p ∨ q ) p ↔ q ⇔ ( p ∧ q ) ∨ ( ¬ p ∧ ¬ q ) The connective “ → ” can be replaced by “ ¬ ” and “ ∨ ” using the following equivalence: p → q ⇔ ¬ p ∨ q Example: ( ¬ q → r ) ∧ ¬ ( p ↔ r ) ⇔ ( ¬¬ q ∨ r ) ∧ ¬ ( p ↔ r ) ⇔ ( ¬¬ q ∨ r ) ∧ ¬ (( p ∧ r ) ∨ ( ¬ p ∧ ¬ r )) Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 30 / 54

  69. Equivalent Transformations Every formula can be transformed to an equivalent formula, which contains only logical connectives “ ¬ ”, “ ∧ ” and “ ∨ ”, and where negations are applied only to atomic propositions. We can assume that formula contains only “ ¬ ”, “ ∧ ” and “ ∨ ”. Negations can be “pushed” to atomic propositions using the following equivalences: ¬¬ p ⇔ p ¬ ( p ∧ q ) ⇔ ¬ p ∨ ¬ q ¬ ( p ∨ q ) ⇔ ¬ p ∧ ¬ q Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 31 / 54

  70. Equivalent Transformations Example: ( ¬¬ q ∨ r ) ∧ ¬ (( p ∧ r ) ∨ ( ¬ p ∧ ¬ r )) ⇔ ( q ∨ r ) ∧ ¬ (( p ∧ r ) ∨ ( ¬ p ∧ ¬ r )) ⇔ ( q ∨ r ) ∧ ( ¬ ( p ∧ r ) ∧ ¬ ( ¬ p ∧ ¬ r )) ⇔ ( q ∨ r ) ∧ (( ¬ p ∨ ¬ r ) ∧ ¬ ( ¬ p ∧ ¬ r )) ⇔ ( q ∨ r ) ∧ (( ¬ p ∨ ¬ r ) ∧ ( ¬¬ p ∨ ¬¬ r )) ⇔ ( q ∨ r ) ∧ (( ¬ p ∨ ¬ r ) ∧ ( p ∨ ¬¬ r )) ⇔ ( q ∨ r ) ∧ (( ¬ p ∨ ¬ r ) ∧ ( p ∨ r )) Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 32 / 54

  71. Logical Constants For some purposes it can be useful to introduce the following special formulas: ⊤ — a formula, which is always true ⊥ — a formula, which is always false For every truth valuation v it holds: v | ( ⊤ has always truth value 1) = ⊤ v � | = ⊥ ( ⊥ has always truth value 0) Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 33 / 54

  72. Logical Constants Symbols ⊤ and ⊥ can be viewed as abbreviations: ⊤ stands for an arbitrary tautology (e.g., p → p ) ⊥ stands for an arbitrary contradiction (e.g., p ∧ ¬ p ) Alternatively, we could extend the definition of syntax and semantics of propositional logic. Symbols ⊤ and ⊥ can be viewed as logical connectives with arity 0. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 34 / 54

  73. Logical Constants Examples of equivalences that hold for ⊤ and ⊥ (and for arbitrary p ): ⊤ ⇔ p ∨ ¬ p ⊥ ⇔ p ∧ ¬ p ¬ ⊤ ⇔ ⊥ ¬ ⊥ ⇔ ⊤ p ∧ ⊤ ⇔ p p ∨ ⊥ ⇔ p p ∨ ⊤ ⇔ ⊤ p ∧ ⊥ ⇔ ⊥ Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 35 / 54

  74. Equivalence of Formulas It is not necessary for equivalent formulas to contain the same atomic propositions. Example: ( q → ¬¬ q ) ∧ ¬ p ⇔ p → ( r ∧ ¬ r ) ( q → ¬¬ q ) ∧ ¬ p ⇔ ( q → q ) ∧ ¬ p ⇔ ⊤ ∧ ¬ p ⇔ ¬ p ⇔ ¬ p ∨ ⊥ ⇔ p → ⊥ ⇔ p → ( r ∧ ¬ r ) For example, also all tautologies are logically equivalent. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 36 / 54

  75. Conjunctions and Disjunctions of Several Formulas Due to associativity of conjunction, it holds for example: p ∧ (( q ∧ r ) ∧ ( s ∧ t )) ⇔ ( p ∧ q ) ∧ (( r ∧ s ) ∧ t ) Both these formulas are also equivalent to formulas p ∧ ( q ∧ ( r ∧ ( s ∧ t ))) ((( p ∧ q ) ∧ r ) ∧ s ) ∧ t All these formulas are true iff all propositions p , q , r , s , and t are true. Convention: Due to associativity of conjunction, the parentheses can be omitted and we can write p ∧ q ∧ r ∧ s ∧ t Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 37 / 54

  76. Conjunctions and Disjunctions of Several Formulas Because conjunction is not only associative but also commutative, the order of members of such more complicated conjunction is not important. For example: r ∧ t ∧ q ∧ s ∧ p p ∧ q ∧ r ∧ s ∧ t ⇔ Due to idempotence, also the number of occurrences of each member is not important. For example: p ∧ q ∧ p ⇔ q ∧ p ∧ q ∧ q Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 38 / 54

  77. Conjunctions and Disjunctions of Several Formulas The same holds also for disjunction, e.g.: ( p ∨ q ) ∨ ( r ∨ q ) q ∨ ( p ∨ ( r ∨ ( r ∨ r ))) ⇔ Convention: Instead of ( p ∨ q ) ∨ ( r ∨ ( s ∨ t )) we can write p ∨ q ∨ r ∨ s ∨ t All this holds not only for atomic propositions but also for arbitrary formulas, e.g.: Instead of ( ϕ 1 ∧ ϕ 2 ) ∧ ( ϕ 3 ∧ ( ϕ 4 ∧ ϕ 5 )) we can write ϕ 1 ∧ ϕ 2 ∧ ϕ 3 ∧ ϕ 4 ∧ ϕ 5 Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 39 / 54

  78. Conjunctions and Disjunctions of Several Formulas Conjunction of n formulas ϕ 1 , ϕ 2 , . . . , ϕ n , where n ≥ 0, is the formula ϕ 1 ∧ ϕ 2 ∧ · · · ∧ ϕ n In particular: For n = 0, the conjunction is the formula ⊤ . For n = 1, the conjunction is the formula ϕ 1 . Disjunction of n formulas ϕ 1 , ϕ 2 , . . . , ϕ n , where n ≥ 0, is the formula ϕ 1 ∨ ϕ 2 ∨ · · · ∨ ϕ n In particular: For n = 0, the disjunction is the formula ⊥ . For n = 1, the disjunction is the formula ϕ 1 . Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 40 / 54

  79. Conjunctions and Disjunctions of Several Formulas Conjunction ϕ 1 ∧ ϕ 2 ∧ · · · ∧ ϕ n : The whole formula is true iff all formulas ϕ 1 , ϕ 2 , . . . , ϕ n are true. If some formula ϕ i is equivalent to ⊥ , then the whole formula is equivalent to ⊥ . If some formula ϕ i is equivalent to a negation of some formula ϕ j (i.e., ϕ i ⇔ ¬ ϕ j ), then the whole formula is equivalent to ⊥ . If some formula ϕ i is equivalent to ⊤ , then it is possible to omit the formula ϕ i from the whole formula. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 41 / 54

  80. Conjunctions and Disjunctions of Several Formulas Disjunction ϕ 1 ∨ ϕ 2 ∨ · · · ∨ ϕ n : The whole formula is true iff at least one of formulas ϕ 1 , ϕ 2 , . . . , ϕ n is true. If some formula ϕ i is equivalent to ⊤ , then the whole formula is equivalent to ⊤ . If some formula ϕ i is equivalent to a negation of some formula ϕ j (i.e., ϕ i ⇔ ¬ ϕ j ), then the whole formula is equivalent to ⊤ . If some formula ϕ i is equilvalent to ⊥ , then it is possible to omit the formula ϕ i from the whole formula. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science February 14, 2020 42 / 54

Recommend

Section 1.3 Tautologies, Contradictions, and Contingencies A tautology is a proposition

Section 1.3 Tautologies, Contradictions, and Contingencies A tautology is a proposition

Section 1.3 Tautologies, Contradictions, and Contingencies A tautology is a proposition which is always true. Example: p p A contradiction is a proposition which is always false. Example: p p A contingency is a

239 views • 23 slides
strongly equal k-tautologies in some proof systems. Anahit Chubaryan and Garik Petrosyan

strongly equal k-tautologies in some proof systems. Anahit Chubaryan and Garik Petrosyan

On the relations between the proof complexity measures of strongly equal k-tautologies in some proof systems. Anahit Chubaryan and Garik Petrosyan (speaker) Department of Informatics and Applied Mathematics Yerevan State University

645 views • 39 slides
Monadic Predicate ukasiewicz Logic. Standard versus General Tautologies Flix Bou University

Monadic Predicate ukasiewicz Logic. Standard versus General Tautologies Flix Bou University

Monadic Predicate ukasiewicz Logic. Standard versus General Tautologies Flix Bou University of Barcelona (UB) bou@ub.edu May 20th ASUV 2011 (Salerno) Flix Bou (UB) Monadic Predicate ukasiewicz Logic May 20th, ASUV2011, Salerno 1 /

1.04k views • 69 slides
Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Valentin Goranko Stockholm University September 2016 Goranko Propositions Proposition: statement which can be

382 views • 21 slides
G22.2390-001 Logic in Computer Science Fall 2009 Lecture 3 1 Review Last week

G22.2390-001 Logic in Computer Science Fall 2009 Lecture 3 1 Review Last week

G22.2390-001 Logic in Computer Science Fall 2009 Lecture 3 1 Review Last week Propositional Logic: Semantics Satisfiability and Tautologies Propositional Connectives and Boolean Functions Compactness 2 Outline

1.41k views • 128 slides
Revision on propositional logic: Propositions. Logical Connectives. Truth values and truth

Revision on propositional logic: Propositions. Logical Connectives. Truth values and truth

Revision on propositional logic: Propositions. Logical Connectives. Truth values and truth tables. Propositional formulae. Tautologies. Logical equivalence. Logical consequence. Logical correctness of propositional arguments. Valentin Goranko

600 views • 20 slides
Classical Logic = Fibred MLL Dominic Hughes Stanford University (Speaker: Vaughan Pratt,

Classical Logic = Fibred MLL Dominic Hughes Stanford University (Speaker: Vaughan Pratt,

Classical Logic = Fibred MLL Dominic Hughes Stanford University (Speaker: Vaughan Pratt, Stanford University) 0-0 Classical Logic = Fibred MLL Boolean tautologies are characterizable bureaucratically: as theorems derivable in some proof

319 views • 9 slides

More recommend