Which pattern fails in every possible case, whatever p stands for?
Ap ∨ ~ p
Bp ∨ q
Cp ∧ ~ p
Dp → p
Answer & Solution
Correct answer: C. p ∧ ~ p
p and ~ p can never both be true, so the conjunction is always false.
Keep practising Mathematical Logic
Browse all Mathematical Logic questions for MHT-CET, or explore more Mathematics topics.
Related questions
The lamp in a parallel circuit of two switches is off only whenIn switching tests, the value 1 stands for a switch that isTwo switches wired side by side, in parallel, act likeTwo switches wired one after another, in series, act likeJoining any statement p with a tautology by 'or' always yieldsSimplify p ∨ (p ∧ q) using absorption:Rewriting 'p if and only if q' using implications givesRewriting an implication p → q using only ~ and ∨ gives