Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Homework Help: Discrete Mathematics again

  1. Oct 13, 2008 #1
    :confused: Construct a formal proof of the theorem:

    If (p-> q), (neg [r] -> s), and (neg [q] V neg , then (p-> r).

    [refer to table of logical equivalences (p62) and the table of logical implication (p62)]The tables are in the textbook Kenneth Ross, 5th edition, Discrete Math's.

    First I have to construct the proof line: I am gessing that the hypotheses are like this, but am not sure for their order:
    (neg [r] -> s) /\ (p -> q) /\ (neg [q] V neg ) => (p -> r)

    Then I need to make the "formal proof of it" using the tables.

    Please someone help me with any sugestion how to keep going with this problem.
    Thank you:
     
  2. jcsd
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted