Constructive Proof of Material Implication

Hugo Ferreira
Messages
1
Reaction score
0
Hi,

I'm struggling to find a constructive proof (through natural deduction) of the material implication replacement rule (i.e., that (a => b) <=> (~a \/ b). I believe the only possible way would be through contradiction, but I can't seem to get to it. Is it even possible?

Thx.
 
Physics news on Phys.org
IF by "constructive proof" in a natural deduction system you mean a proof using only intuitionistic rules, then it's not possible: the implication

\left(p\rightarrow q\right)\rightarrow\left(\neg p \vee q\right)

is not intuitionistically valid, whereas the reverse one:

\left(\neg p \vee q\right)\rightarrow\left(p\rightarrow q\right)

is, so this one may be proved only with intuitionistic rules.

The first implication is only classically valid, so its proof must use a non-intuitionistic rule, like

\Phi,\neg\alpha\vdash\bot \Rightarrow \Phi\vdash\alpha
 
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