Results 1 to 3 of 3

Math Help - Sentential Derivation (logic) help please

  1. #1
    Junior Member
    Joined
    Nov 2009
    Posts
    38

    Sentential Derivation (logic) help please

    I really can't figure this derivation out.

    Assumptions:
    1. \neg (F \vee G) iff (\neg F \supset \neg F)
    2. \neg G \supset F

    I need to derive contradicting sentences to show that it is inconsistent, I can tell it is since \negF\supset\negF is always true, which means ~(F v G) is true, so F and G both have to be false individually, which would contradict the \neg G \supset F since ~G would be true and F is false.

    However, I don't know how to formulate this in SD (going by The Logic Book 5th edition by Bergmann). Can anyone help?

    Thanks in advance!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    A Plied Mathematician
    Joined
    Jun 2010
    From
    CT, USA
    Posts
    6,318
    Thanks
    4
    Awards
    2
    So, you're asked to produce a contradiction out of the following assumptions:

    1. \neg(F\vee G)\iff(\neg F\to\neg F)
    2. \neg G\to F.

    Forgive me for changing notation, but I hate the horseshoe for implication. I can never remember which way it's supposed to go!

    I would go about it this way:

    1. First, assume F.
    2. Then, show that \neg F\to\neg F.
    3. Second, assume \neg F.
    4. Then, show that \neg F\to\neg F.
    5. The law of the excluded middle (which in natural deduction you can derive from scratch!) tells you that F\vee\neg F.
    6. Therefore, you can conclude that \neg F\to \neg F.

    Alternatively, you can go like this:

    1. F\vee\neg F. Law of excluded middle.
    2. \neg F\to \neg F by equivalence with step 1.

    I'm just following the outline of the (valid) proof you've already provided. I think once you get started, you'll be able to continue.

    So, how would you write this up so far in a two-column proof? And how would you continue?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    Joined
    Oct 2006
    Posts
    71
    Quote Originally Posted by swtdelicaterose View Post
    I really can't figure this derivation out.

    Assumptions:
    1. \neg (F \vee G) iff (\neg F \supset \neg F)
    2. \neg G \supset F

    I need to derive contradicting sentences to show that it is inconsistent, I can tell it is since \negF\supset\negF is always true, which means ~(F v G) is true, so F and G both have to be false individually, which would contradict the \neg G \supset F since ~G would be true and F is false.

    However, I don't know how to formulate this in SD (going by The Logic Book 5th edition by Bergmann). Can anyone help?

    Thanks in advance!
    If you have her rules of replacement to play with, then a formal derivation of a self-contradiction is pretty straightforward.
    On the other hand, if by SD you mean precisely SD and nothing more,
    then (it still may be considered straight forward, but) it's going to be lengthy.

    Let's suppose you have the replacement rules; then the self-contradiction (G V F) & ~(G V F) can be reach in ten lines.
    At that point you're done.

    All you need to reach that particular contradiction are the following rules applied in "some order":

    Primitive rules of inference: R, ->I, <->E, &I
    Rules of replacement: Com, Impl, DN
    Last edited by PiperAlpha167; July 31st 2010 at 01:59 AM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. logic derivation
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 17th 2011, 04:43 AM
  2. Can someone check my logic (sentential logic)
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: July 13th 2010, 04:30 AM
  3. sentential logic derivations?
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: November 19th 2009, 04:27 PM
  4. Sentential Logic Problem
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 7th 2009, 07:00 AM
  5. A very annoying and simple logic derivation problem.
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: January 14th 2009, 09:01 PM

Search Tags


/mathhelpforum @mathhelpforum