I am working on a problem for an online class that I'm struggling to figure out.
I'm given these premises: 1. (H > (A > B)) (The > sign here represents conditional) 2. (~K & ~B) 3. (~A > K)
The desired conclusion is ~H.
My hunch tells me I need to use negation introduction on premises 2 and 3 to derive ~~A and ~~B, from which point I can use negation elimination to derive A and B. Does anyone have an idea of how to approach this?