Prove that the expression is a valid argument using the deduction method

In summary: This argument is valid because it follows the form of the proof sequence below, using universal instantiation (ui) and existential generalization (eg), which are valid rules of inference.1.(∃x)[P(x) → Q(x)] prem2.(∀y)[Q(y) → R(y)] prem3.(∀x)P(x) prem4.P(x) 3,ui5.P(x) →Q(x) 1,ui6.Q(x) 4,5,mp7.Q(x) → R(x) 2,ui8.R(x) 6,7,mp9.(∃x)R(x) 8,egIn summary, the
  • #1
stan1992
7
0
(∃x)[P(x) → Q(x)]∧(∀y)[Q(y) → R(y)]∧(∀x)P(x) → (∃x)R(x)
 
Physics news on Phys.org
  • #2
Please write the complete problem statement in the body of the message and not in the thread title.

Also, please give the definitions of "valid argument" and "deduction method" since these concepts differ between textbooks.

Finally, http://mathhelpboards.com/rules/ ask you to show some effort. What exactly is your difficulty in solving this problem?
 
  • #3
Evgeny.Makarov said:
Please write the complete problem statement in the body of the message and not in the thread title.

Also, please give the definitions of "valid argument" and "deduction method" since these concepts differ between textbooks.

Finally, http://mathhelpboards.com/rules/ ask you to show some effort. What exactly is your difficulty in solving this problem?

Prove that the expression below is a valid argument using the deduction method (that is using equivalences and rules
of inference in a proof sequence)

(∃x)[P(x) → Q(x)]∧(∀y)[Q(y) → R(y)]∧(∀x)P(x) → (∃x)R(x)

1.(∃x)[P(x) → Q(x)] prem
2.(∀y)[Q(y) → R(y)] prem
3.P(x)→Q(x) 1,ui
4.P(x) 2,ui
5.(∀x)Q(x) 5,ug
6.??
7.??
n.(∃x)R(x)

I don't know how to finish this or if I'm even on the right track
 
  • #4
I have bad news for you: rules of inference differ between textbooks, too, as stated in this https://driven2services.com/staging/mh/index.php?threads/29/. (Smile) Therefore, you'll have to list the rules and equivalences or at least give the book reference.

stan1992 said:
(∃x)[P(x) → Q(x)]∧(∀y)[Q(y) → R(y)]∧(∀x)P(x) → (∃x)R(x)

1.(∃x)[P(x) → Q(x)] prem
2.(∀y)[Q(y) → R(y)] prem
It would make sense to add the third premise (∀x)P(x).

Informally, the reasoning is as follows. $P(x)$ holds for all $x$, and for at least one of them $P(x)$ implies $Q(x)$. Therefore, $Q(x)$ holds for some $x$. Further, $Q(y)$ always implies $R(y)$, including when $y$ equals the $x$ found earlier. Thus, $R(x)$ holds for that $x$.
 

FAQ: Prove that the expression is a valid argument using the deduction method

What is the deduction method?

The deduction method is a logical process used to determine the validity of an argument. It involves using premises or known facts to reach a conclusion.

How do you prove that an expression is a valid argument using the deduction method?

To prove that an expression is a valid argument using the deduction method, you need to first identify the premises and the conclusion of the argument. Then, you need to use the rules of deduction to show that the conclusion logically follows from the premises.

What are the rules of deduction?

The rules of deduction include modus ponens, modus tollens, hypothetical syllogism, disjunctive syllogism, and addition and simplification. These rules help determine the validity of an argument by following logical principles.

Can the deduction method be used for all types of arguments?

Yes, the deduction method can be used for all types of arguments, including mathematical, scientific, and philosophical arguments. It is a universal method of determining the validity of an argument.

What if an expression cannot be proven as a valid argument using the deduction method?

If an expression cannot be proven as a valid argument using the deduction method, it does not necessarily mean that the argument is invalid. It may be necessary to use other methods of reasoning or gather more evidence to determine the validity of the argument.

Back
Top