Is This Logical Argument Valid?

Euler2718
Messages
90
Reaction score
3

Homework Statement



Determine whether the following is valid:

p \rightarrow \neg q , r \rightarrow q , r, \vdash \neg p

Homework Equations



Modus Ponens, disjunctive syllogism, double negation.

The Attempt at a Solution



I've boiled it down to

p \rightarrow \neg q , q, \vdash \neg p

However I do not understand how the book says to use disjunctive syllogism and double negation here. I've expanded the implication into its fundamental forum but I still can't see it.
 
Physics news on Phys.org
These problems always depend on what rules of inference, axioms and replacement rules you've been given.
##p\to \neg q## is equivalent to ##\neg p\vee \neg q##. This may be specified as a replacement rule, or as the definition of one or the other of ##\to## or ##\vee##.

Using that replacement, are you able to do the problem using DNE (##\neg\neg q\equiv q##) and then DS?
 
  • Like
Likes Euler2718
andrewkirk said:
These problems always depend on what rules of inference, axioms and replacement rules you've been given.
##p\to \neg q## is equivalent to ##\neg p\vee \neg q##. This may be specified as a replacement rule, or as the definition of one or the other of ##\to## or ##\vee##.

Using that replacement, are you able to do the problem using DNE (##\neg\neg q\equiv q##) and then DS?

I've got it now, thank you. I wasn't seeing how ##neg neg q \equiv q ## would fit to DS, but now it's clear.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top