Consider the argument with premise ∀x(P(x) ∨ Q(x)) and conclusion (∀x P(x)) ∧ (∀x Q(x)): (A) ∀x(P(x) ∨ Q(x)) premise; (B) P(c) ∨ Q(c) universal instantiation from A; (C) P(c) simplification from B; (D) ∀x P(x) universal generalization of C; (E) Q(c) simplification from B; (F) ∀x Q(x) universal generalization of E; (G) (∀x P(x)) ∧ (∀x Q(x)) conjunction of D and F.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. Steps (C) and (E) are not correct inferences
Explanation
Simplification applies to a conjunction, not a disjunction: from P(c) ∨ Q(c) you cannot infer P(c) or Q(c). Steps C and E are invalid.
More Discrete Structures and Optimization questions
- Consider the following statements: (A) Any tree is 2-colorable (B) A graph G has no cycles of even length if it is bipartite. (C) A graph G…
- Consider the statement: A person who is radical (R) is electable (E) if he/she is conservative (C), but otherwise is not electable. Which o…
- Let R1 = {(1,1), (2,2), (3,3)} and R2 = {(1,1), (1,2), (1,3), (1,4)}. Match List I with List II. List I: A. R1 ∪ R2, B. R1 − R2, C. R1 ∩ R2…
- Find the lexicographic ordering of the bit strings 0 < 1 given below based on the ordering . (A) 001 (B) 010 (C) 011 (D) 0001 (E) 0101 Choo…
- Statement I: 5 divides n⁵ − n whenever n is a non-negative integer. Statement II: 6 divides n³ − n whenever n is a non-negative integer.
- A basic feasible solution of an transportation problem is said to be non- degenerate, if basic feasible solution contains exactly----------…