edited by
9,420 views
30 votes
30 votes

Indicate which of the following well-formed formulae are valid:

  1. $\left(P\Rightarrow Q\right) {\wedge} \left(Q \Rightarrow R\right) \Rightarrow \left(P \Rightarrow R\right)$
  2. $\left(P\Rightarrow Q\right) \Rightarrow \left( \neg P \Rightarrow \neg Q\right)$
  3. $\left(P{\wedge} \left(\neg P \vee  \neg Q\right)\right) \Rightarrow Q$
  4. $\left(P \Rightarrow R\right) \vee \left(Q \Rightarrow R\right) \Rightarrow \left(\left(P \vee Q \right)  \Rightarrow R\right)$
edited by

6 Answers

1 votes
1 votes

(A) option is correct

Solution:

1 votes
1 votes

the same idea as in  answer by Tuhin but with the different format

An argument is valid if we cannot make all premises true and the conclusion false without getting contradiction

An argument is invalid if can make all premises true and the conclusion false.

1

2

3

edited by
Answer:

Related questions

20 votes
20 votes
3 answers
2
makhdoom ghaya asked Nov 22, 2016
9,119 views
Let $R_{1}$ and $R_{2}$ be regular sets defined over the alphabet $\Sigma$ Then:$R_{1} \cap R_{2}$ is not regular.$R_{1} \cup R_{2}$ is regular.$\Sigma^{*}-R_{1}$ is regu...
46 votes
46 votes
2 answers
3
makhdoom ghaya asked Nov 22, 2016
12,705 views
It is undecidable whether:An arbitrary Turing machine halts after $100$ steps.A Turing machine prints a specific letter.A Turing machine computes the products of two numb...
27 votes
27 votes
2 answers
4
makhdoom ghaya asked Nov 22, 2016
16,869 views
Recursive languages are:A proper superset of context free languages.Always recognizable by pushdown automata.Also called type $0$ languages.Recognizable by Turing machine...