hw3 - Philosophy 12A Homework Assignment #3 September 26,...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Philosophy 12A Homework Assignment #3 September 26, 2008 Six Validity Testing Problems (Truth-Table Methods) Use a truth-table method (either the exhaustive method, or the “short” method) to determine whether each of the following three (3) LSL arguments/sequents is valid or invalid. For the “short” method, follow the guidelines discussed in lecture for presenting answers ( viz ., see my handout with 3 examples). 1. A C B C A B C 2. I N ( K D) N D → ∼ I ∴ ∼ I (N K) 3. ( O → ∼ S) (O (M I)) I → ∼ M ∴ ∼ S For the next three, follow the directions in the text ( i.e. , use the “short” method). 4. Page 66, I: #1 5. Page 66, I: #5 6. Page 66, I: #8 Since some people have an old printing of the textbook, I’ve included the salient part of the latest (4th) printing of the textbook below: 66 Chapter 3: Semantics for Sentential Logic the symbol ‘ ± ’ for LSL is just like the definition of ‘valid argument-form of LSL’:
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/23/2009 for the course PHIL 12A taught by Professor Fitelson during the Spring '08 term at University of California, Berkeley.

Ask a homework question - tutors are online