Unit 6 Answers

1.

  1. Addition
  2. Simplification
  3. Modus ponens
  4. Modus tollens
  5. Disjunctive syllogism

2.

  1. The argument is translated as follows:
    T imp.gif (64 bytes) S
    T or.gif (64 bytes) C
    not.gif (54 bytes)S
    ----------------------------------------------------
    C

    The inference rules used are:
    From ( T imp.gif (64 bytes) S )   and not.gif (54 bytes)S
    by modus tollens we deduce not.gif (54 bytes)T
    From not.gif (54 bytes)T and ( T or.gif (64 bytes) C )
    by disjunctive syllogism we conclude C.


  2. The argument is translated as follows:
    not.gif (54 bytes)( S imp.gif (64 bytes) W )   and.gif (67 bytes)   not.gif (54 bytes) ( R or.gif (64 bytes) C )
    -----------------------------------------------------
    ( not.gif (54 bytes)W and.gif (67 bytes) not.gif (54 bytes) C )

    The inference rules used are:
    not.gif (54 bytes) ( S imp.gif (64 bytes) W ) is equivalent to ( S and.gif (67 bytes) not.gif (54 bytes)W )
    by implication and De Morgan
    Also not.gif (54 bytes) ( R or.gif (64 bytes) C ) is equivalent to ( not.gif (54 bytes)R and.gif (67 bytes) not.gif (54 bytes)C ) by De Morgan.
    Hence not.gif (54 bytes) ( S imp.gif (64 bytes) W ) and.gif (67 bytes) not.gif (54 bytes) ( R or.gif (64 bytes) C ) is equivalent to ( S and.gif (67 bytes) not.gif (54 bytes)W ) and.gif (67 bytes) ( not.gif (54 bytes)R and.gif (67 bytes) not.gif (54 bytes)C ), which is equivalent to
    ( S and.gif (67 bytes) not.gif (54 bytes)R ) and.gif (67 bytes) ( not.gif (54 bytes)W and.gif (67 bytes) not.gif (54 bytes)C )
    Hence by simplification ( not.gif (54 bytes)W and.gif (67 bytes) not.gif (54 bytes)C )


  3. The argument is translated as follows:
    C imp.gif (64 bytes) S
    not.gif (54 bytes)O imp.gif (64 bytes) not.gif (54 bytes)L
    O imp.gif (64 bytes) C
    -----------------------------------------------------
    not.gif (54 bytes)S imp.gif (64 bytes) not.gif (54 bytes) L

    The inference rules used are:
    not.gif (54 bytes)S imp.gif (64 bytes) not.gif (54 bytes)C
    by Contrapositive of C imp.gif (64 bytes) S
    not.gif (54 bytes)C imp.gif (64 bytes) not.gif (54 bytes)O
    by Contrapositive of O imp.gif (64 bytes) C
    By hypothetical syllogism from the last two
    not.gif (54 bytes)S imp.gif (64 bytes) not.gif (54 bytes)O
    By another hypothetical syllogism from this and not.gif (54 bytes)O imp.gif (64 bytes) not.gif (54 bytes)L,
    not.gif (54 bytes)S imp.gif (64 bytes) not.gif (54 bytes)L
    is obtained.


  4. The argument is translated as follows:
    not.gif (54 bytes)G imp.gif (64 bytes) not.gif (54 bytes)F
    Z imp.gif (64 bytes) M
    M imp.gif (64 bytes) F
    --------------------------------------------
    Z imp.gif (64 bytes) G

    The inference rules used are:
    >From Z imp.gif (64 bytes) M and
    M imp.gif (64 bytes) F
    by hypothetical syllogism
    Z imp.gif (64 bytes) F is obtained.
    Then from not.gif (54 bytes)G imp.gif (64 bytes) not.gif (54 bytes)F
    by taking contrapositive M imp.gif (64 bytes) F is obtained.
    >From this and Z imp.gif (64 bytes) F
    by hypothetical syllogism Z imp.gif (64 bytes) G is obtained.


  5. The argument is translated as follows:
    R or.gif (64 bytes) ( H and.gif (67 bytes) L )
    not.gif (54 bytes)H or.gif (64 bytes) ( not.gif (54 bytes)L and.gif (67 bytes) R )
    --------------------------------------------
    R

    The inference rules used are:
    From not.gif (54 bytes)H or.gif (64 bytes) ( not.gif (54 bytes)L and.gif (67 bytes) R ) by distributive law
    ( not.gif (54 bytes)H or.gif (64 bytes) not.gif (54 bytes)L ) and.gif (67 bytes) ( not.gif (54 bytes)H or.gif (64 bytes) R )
    From this by simplification
    ( not.gif (54 bytes)H or.gif (64 bytes) not.gif (54 bytes)L )
    From this by De Morgan not.gif (54 bytes)( H and.gif (67 bytes) L )
    With this and R or.gif (64 bytes) ( H and.gif (67 bytes) L )
    by disjunctive syllogism R is concluded.