MHB Can the premise P∨Q be ignored in a propositional logic proof?

Guest2
Messages
192
Reaction score
0
I've to derive the following proposition in PL using the system in http://mathhelpboards.com/discrete-mathematics-set-theory-logic-15/propositional-logic-8386.html (in which Evgeny.Makarov has explained everything ever so kindly to me).

I'm trying to prove $\displaystyle P \vee Q, ~(R ~ \& ~ P) \to \neg Q, ~R, ~ R \to P: \neg Q$. I tried using disjunctions by assuming P to get the conclusion - but then when assumed Q to get the conclusion (its negation) I got stuck. Someone told me that I can ignore $ P \vee Q$ and get the conclusion without. Is this really allowed? In that case I could do the following, I think:

$ \begin{aligned} & \left\{1\right\} ~~~~~~~~~ 1. ~ P \vee Q\ldots \ldots \ldots \ldots \text{premise}
\\& \left\{2\right\} ~~~~~~~~~ 2. ~ \left(R ~ \& ~ P\right) \to \neg Q \ldots . \text{premise}
\\&\left\{3\right\} ~~~~~~~~~ 3. ~R \ldots \ldots \ldots \ldots \ldots \ldots \text{premise}
\\&\left\{4\right\} ~~~~~~~~~ 4. ~R \to P \ldots \ldots \ldots \ldots\text{premise}
\\&\left\{3, ~ 4\right\} ~~~~~ 5. ~P \ldots \ldots \ldots\ldots\ldots .. 3, ~4 \text{MP}
\\&\left\{3, ~4\right\} ~~~~~ 6. ~ R ~ \& ~ P\ldots \ldots \ldots \ldots. 3,5 \text{& I}
\\&\left\{2,~3,~4\right\} ~7. ~ \neg Q \ldots\ldots\ldots\ldots\ldots \text{2, 6 MP} \end{aligned} $

But I'm not sure whether I can really do that. My book has something it calls 'augmentation' and I suspect it may have something to do with that.
 
Last edited:
Physics news on Phys.org
It looks good to me. I don't see any reason why you can't ignore the premiss $P\lor Q$.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top