stan1992
- 7
- 0
(∃x)[P(x) → Q(x)]∧(∀y)[Q(y) → R(y)]∧(∀x)P(x) → (∃x)R(x)
The discussion revolves around proving the validity of a logical argument using the deduction method. Participants explore the expression involving existential and universal quantifiers and implications, focusing on the application of rules of inference and equivalences in formal logic.
Participants do not reach a consensus on the definitions or the approach to the proof. There are differing views on how to proceed with the argument and the necessity of clarifying foundational concepts.
Participants express uncertainty regarding the rules of inference and how they apply to the argument. There is a lack of consensus on the definitions of key terms and the completeness of the problem statement.
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?
It would make sense to add the third premise (∀x)P(x).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