When using reductio ad absurdum to prove (x)Fx ⋁ ($x)Gx, we begin by assuming
A) ~(x)Fx ⋁ ($x)Gx.
B) (x)Fx.
C) ~((x)Fx ⋁ ($x)Gx).
D) (x)Fx • ~($x)Gx.

Name: When using reductio ad absurdum to prove (x)Fx ⋁ ($x)Gx, we begin by assuming A) ~(x)Fx ⋁ ($x)Gx. B) (x)Fx. C) ~((x)Fx ⋁ ($x)Gx). D) (x)Fx • ~($x)Gx.
Brand: Quizplus
Rating: 4.8 (26 reviews)

Question

Quizplus · Accepted Answer

Reductio ad absurdum involves assuming the negation of what you want to prove. Since we want to prove (x)Fx ⋁ ($x)Gx, we assume its negation, which is ~( (x)Fx ⋁ ($x)Gx ).

When Using Reductio Ad Absurdum to Prove (X)Fx ⋁ ($X)Gx