0

I know this question has already been posted but I cannot seem to find an answer there.I am taking this course and I just cannot figure out how to solve this on the platform. Please I really need help with this. The link to the platform is: http://intrologic.stanford.edu/exercises/exercise_04_02.html.

Thanks in advance I would trully be grateful to the person who tells me how to solve this on the given website. Thanks in advance!

1 Answers1

0

This is really easy ... so I figure it must be your first formal proof and I know the learning curve for these formal proofs can be pretty steep, so here are a few pointers:

  1. Look at the main operator of any of your premises, and see if you can apply the corresponding Elimination rule

In your case, you have $p \land q$, so the main operator is $\land$ ... so can you apply $\land$ Elimination on that statement?

  1. Look at the main operator of any of the statements that you are trying to get, and see if you can apply the corresponding Introduction rule

In your case, you want $q \lor r$, so the main operator is $\lor$ ... so can you apply $\lor$ Introduction on some statement to get $q \lor r$> ... which means you need either $q$ or $r$ by itself?

Bram28
  • 100,612
  • 6
  • 70
  • 118