250 views
0 votes
0 votes
how to solve i go to left to right or vice -versa??

S1: (P → (Q ∨ R)) ∧ (P → (Q ∨ ¬R)) → P → Q

S2: (P → Q) ∧ ((Q ∧ R) → S) → (P ∧ R) → S

Which of the following statements is tautology?

(A) Only S1

(B) Only S2

(C) both S1 and S2

(D) None of the above

Please log in or register to answer this question.

Related questions

–1 votes
–1 votes
0 answers
1
rajesh170293 asked Feb 1, 2017
198 views
http://thegatebook.in/qa/1363
0 votes
0 votes
0 answers
2
Hradesh patel asked Nov 20, 2016
380 views
There is a CFG with only 2 variables, and a single terminal, and 2 only productions (No unit, epsilon, useless products, left recursion,). What would be the max number of...
0 votes
0 votes
1 answer
3
Hradesh patel asked Nov 20, 2016
262 views
Here is a CFG with only 2 variables, and a single terminal, and 2 only productions (No unit, epsilon, useless products). What would be the max number of productions if th...