Register

#gatebook

261 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
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

–1 votes
–1 votes
0 answers
1
rajesh170293 asked Feb 1, 2017
199 views
#GATEBOOK Qno.9
http://thegatebook.in/qa/1363
http://thegatebook.in/qa/1363
User Avatar
0 votes
0 votes
0 answers
2
Hradesh patel asked Nov 20, 2016
396 views
#Gatebook Qno.26
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 productions if that gets converted into GNF (A). 2 (B). <=4 (C). <=8 (D). None
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...
User Avatar
0 votes
0 votes
1 answer
3
Hradesh patel asked Nov 20, 2016
272 views
#Gatebook Qno.25
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 that gets converted into CNF (A). 2 (B). <=4 (C). <=8 (D). None
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...
User Avatar
Link Copied!