Consider two well-formed formulas in propositional logic :
F1:P⇒⇁P
F2:(P⇒⇁P)∨(⇁P⇒P)
Which of the following statements is correct ?
F1 is satisfiable , F2 is valid
F1:P→∼P≡P→P′≡P′+P′≡P′
So F1 is contingency. Hence, F1 is satisfiable but not valid.
F2 : (P→∼P)∨(∼P→P)
≡(P→P′)+(P′→P)
≡(P′+P′)+(P+P)
≡P′+P≡1
So F2 is tautology and therefore valid.