1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

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
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you help with the solution or looking for help too?



Similar Discussions: Discrete Mathematics again
Loading...