Computer Sciences > GATE 2021 SET-1 > Mathematical Logic
Let p and q be two propositions.
Consider the following two formulae in propositional logic.
S1: (¬p ∧ (p ∨ q)) → q
S2: q → (¬p ∧ (p ∨ q))
Which one of the following choices is correct?
A
Both S1 and S2 are tautologies.
B
S1 is a tautology but S2 is not a tautology.
C
S1 is not a tautology but S2 is a tautology.
D
Neither S1 nor S2 is a tautology.

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science