1. Math
  2. Advanced Math
  3. let be a well formed formula whose only connective...

Question: let be a well formed formula whose only connective...

Question details

Let α be a well formed formula whose only connective symbols are ∧, ∨, and ¬. Let α∗ be the result of interchanging ∧ and ∨ and replacing each sentence symbol by its negation. Show that α∗ is tautologically equivalent to (¬ α). Use the induction principle.

Remark: It follows that if α |==| β then α∗ |==| β∗.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution