Consider two well-formed formulas in propositional logic
$F_1: P \Rightarrow \neg P$ $F_2: (P \Rightarrow \neg P) \lor ( \neg P \Rightarrow P)$
Which one of the following statements is correct?
F1: $P\to \neg P$
$=\neg P\wedge \neg P$
$=\neg P.$ can be true when P is false ( Atleast one T hence satisfiable)
F2: $ (P\to \neg P)\wedge(\neg P\to P)$
$=\neg P \vee (P\vee P)$
$=\neg P \vee P$
"A valid (true for every set of values) formula is always satisfiable (true for at least one value) , but a satisfiable formula may or may not be valid".
as F1 is not valid but satisfiable,
and F2 is valid(which implicitly means is satisfiable too).
therefore OPTION A is the complete solution, but OPTION D is not.
There is one more problem. Ppl who have...