edited by
858 views
9 votes
9 votes

Let $F$ and $G$ be two propositional formula.
Which of the following is/are True?

  1. $F \vee G$ is a tautology iff at least one of them is a tautology
  2. if $F \rightarrow G$ is a tautology and $F$ is a tautology, then $G$ is a tautology.
  3. $(F \rightarrow G) \vee (F \rightarrow \neg G)$ is a tautology.
  4. $(F \rightarrow G) \wedge (F \rightarrow \neg G)$ is a tautology iff $F$ is a contradiction.
edited by

1 Answer

Best answer
15 votes
15 votes

Answer: B, C, D

Given $F$ and $G$ are propositional formula.

  1. It is false because for $F \lor G$ to be a tautology there is a possiblity that when $F$ is false $G$ is true and vice versa, in this case both $F$ and $G$ are contingency yet $F \lor G$ is tautology.

 

  1. If $F$ is tautology and $F \rightarrow G$ is tautology then $G$ must be a tautology because if $G$ is either contingency and takes False or it is contradiction then $F \rightarrow G$ will not be a tautology.

 

  1. Let’s simplify this 
    $(F \rightarrow G) \lor (F \rightarrow \lnot G) = \lnot F \lor G \lor \lnot F \lor \lnot G$ as we can see $G \lor \lnot G$ will always gives True and $T \lor anything$ is true, hence this is a tautology.

 

  1. For this let’s consider $F$ is either contingency or a tautology in this case $F$ can be True, now if $F$ is true then for $(F \rightarrow G) \land (F \rightarrow \lnot G)$ to be a tautology both $G$ and $\lnot G$ must be true that is not possible obviously, so for $(F \rightarrow G) \land (F \rightarrow \lnot G)$ to be tautology $F$ must be a contradiction.
selected by
Answer:

Related questions