Ask your own question, for FREE!
Mathematics 22 Online
OpenStudy (anonymous):

prove using the Hilbert System {¬q} ⊢ (p→q)→(¬p) This means that I can assume (¬q) and must prove (p→q)→(¬p) The only things I have available to me are these axioms A1 (A -> (B->A)) A2 ((A -> (B->C)) -> ((A->B)->(A->C))) A3 (((~A) -> (~B)) -> (B->A)) and modus ponens which states if we have A->B and A we can infer B I can't use any other theorems only these axioms

OpenStudy (anonymous):

I've spent a long time trying to find this proof and I think I have it to the point where all I need to prove is just the (¬p) part

OpenStudy (helder_edwin):

do u know the Deduction Theorem

OpenStudy (anonymous):

I do know it, but I can't use it unless I can derive it using the axioms

OpenStudy (anonymous):

I have used the axioms to the point where I can assume (p→q) though

OpenStudy (helder_edwin):

the deduction them says then if \(\Sigma\cup\{\psi\}\vdash\phi\) then \(\Sigma\vdash(\psi\to\phi)\)

OpenStudy (anonymous):

yeah, but I need to prove this explicitly with the whole thing being a line of steps applying only the axioms and modus ponens my prof implied that there was a way to get the result of the deduction theorem with only the axioms though

OpenStudy (helder_edwin):

ok. i get it.

OpenStudy (helder_edwin):

can u post the proof u have so far?

OpenStudy (helder_edwin):

sorry. but i can't figure it out.

OpenStudy (anonymous):

well I found a problem with what I have

OpenStudy (anonymous):

me either really

OpenStudy (anonymous):

I keep trying to simplify down to well I have (¬q) →(¬p) somehow

OpenStudy (anonymous):

but I really just can't make it there

OpenStudy (anonymous):

all I can get to is ((¬¬q)→(¬¬p))→((¬q) →(¬p)) A3

OpenStudy (anonymous):

but I don't know how I can get to ((¬¬q)→(¬¬p)) so I can modus ponens it away

OpenStudy (helder_edwin):

i was trying to the same

OpenStudy (anonymous):

there was a more involved way of getting there, but I have to use other proofs as theorems

OpenStudy (anonymous):

and those theorems used the deduction theorem

OpenStudy (anonymous):

which meant I couldn't do them in line with everything else like they wanted me to

OpenStudy (helder_edwin):

this proofs can be very exasperating.

OpenStudy (anonymous):

yes they can. I've spent more hours than I should have on this one. It's my first one too, so I thought I may have overlooked some way to use the axioms

OpenStudy (anonymous):

there are 2 others that I'm stuck on too. ⊢ ((¬p)→p)→p and ⊢ p→(¬¬p) do you think you could maybe take a stab at these ones too?

OpenStudy (anonymous):

I don't feel like I'm going to be able to get the first one

OpenStudy (helder_edwin):

when is your homework due?

OpenStudy (anonymous):

tomorrow night at midnight.

OpenStudy (helder_edwin):

so u have a whole day

OpenStudy (anonymous):

well I have a midterm to study for on thursday, so I was hoping to finish it tonight.

OpenStudy (helder_edwin):

i understand

OpenStudy (anonymous):

Thanks for your help though, I really appreciate it. Working on these by myself for so long hasn't been very pleasant haha

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!