2 votes 2 votes Consider the following argument with premise $\forall _x (P(x) \vee Q(x))$ and conclusion $(\forall _x P(x)) \wedge (\forall _x Q(x))$ $\begin{array}{|ll|l|} \hline (A) & \forall _x (P(x) \vee Q(x)) & \text{Premise} \\ \hline (B) & P(c) \vee Q(c) & \text{Universal instantiation from (A)} \\ \hline (C) & P(c) & \text{Simplification from (B)} \\ \hline (D) & \forall _x P(x) & \text{Universal Generalization of (C)} \\ \hline (E) & Q(c) & \text{Simplification from (B)} \\ \hline (F) & \forall _x Q(x) & \text{Universal Generalization of (E)} \\ \hline (G) & (\forall _x P(x)) \wedge (\forall _xQ(x)) & \text{Conjuction of (D) and (F)} \\ \hline \end{array}$ This is a valid argument Steps $(C)$ and $(E)$ are not correct inferences Steps $(D)$ and $(F)$ are not correct inferences Step $(G)$ is not a correct inference Discrete Mathematics ugcnetcse-oct2020-paper2 discrete-mathematics first-order-logic + – go_editor asked Nov 20, 2020 • recategorized Nov 27, 2020 by Krithiga2101 go_editor 984 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes option B is right ans Steps (C) and (E) are not correct inferences as in Step (C) we can not infer P(C) from P(C)V Q(C) { it only means at least one of them is true) and similarly in Step (E) we can not infer Q(C) from P(C)V Q(C) Rest are all ok Sanjay Sharma answered Nov 22, 2020 Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.