Oh, a break! A logic puzzle   In a mythical (?) community, politicians always lie and non-politicians always tell the truth. A stranger meets 3 natives.   She asks the first native if he is a politician. He answers.   The second native states that the first denied being a politician.   The third native says that the first native is a politician.   How many of these natives are politicians?

  Possible solutions?   None, one, two, or three.   She asks the first native if he is a politician. He answers.   What might he have answered?   Could he answer “No”?   Could he answer “Yes”?

  Given what we’ve found out, have we learned anything about the second native, who said   The first native denied being a politician.   Yes: she is telling the truth, and thus not a politician.   So far, then, we know there are at most two politicians.

  What about the third native, who said “the first native is a politician”?   What are the possibilities?   He’s telling the truth.   He’s lying.   Can we tell which?   Does it matter?

  If he’s lying, he’s a politician and the first native is not.   If he’s telling the truth, then he’s not a politician and the first native is.   So, what we know is that either the first native or the third is lying, and that the other is telling the truth.   So, we know that there is one, and only one, politician.

The syntax of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of derivability   A derivation: a finite number of steps, based on the rules of SD, that demonstrates that some sentence of SL can be derived from some other sentence of SL or set of sentences of SL (including the empty set), using the derivation rules of SD.   Like the truth table method, derivations are an effective method for demonstrating logical status.   SD: the derivation system.   11 rules: for each connective, one rule to introduce it and one rule to eliminate it, plus reiteration.

The syntax of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of derivability (and in this case in the system SD.   Examples:   An argument is valid in SD IFF the conclusion can be derived from the premises in SD.   A sentence is a theorem in SD IFF it can be derived from the empty set.   The only notions not carried over are logical falsehood and logical indeterminacy.

Derivation conventions and rules   Derivations always include one scope line (a vertical line). This indicates what follows (what sentence is derivable using SD) from another because each falls within the scope of that line.   Each line in a derivation is numbered.   If the derivation includes primary assumptions, these form the first rows and are followed by a horizontal line.

Derivation conventions and rules   Every line of a derivation must be justified: it must either be a primary assumption (and noted as such) an auxiliary assumption when the rule calls for one, and noted as such, and/or a sentence for which the rule and line numbers from which it is derived must be cited. Justifications are noted to the right of each line.   The single turnstile ⊦ is used to symbolize derivability.

Derivation conventions and rules   Every line of a derivation must be justified: it must either be a primary assumption (and noted as such) or an auxiliary assumption when the rule calls for one …   4 rules require subderivations, which in turn require a new scope line and an auxiliary assumption.   All subderivations must be discharged in the way they dictate and at the main scope line.

Derivations Show that {A  ~C, A & B} ⊦ ~C A  ~CA A & BA A ~C  E

Derivations Show that {A  ~C, A & B} ⊦ ~C A  ~CA A & BA A2 &E ~C1, 3  E

Rules of SD You have been introduced to R, Reiteration P PR PR This rule is used in derivations that involve a subderivation…

Rules of SD You have been introduced to &E P & Q P & Q P&E P&E

Rules of SD You have been introduced to &I P Q P&Q &I P&Q &I

Rules of SD You have been introduced to  E P  Q P  Q P Q Q  E

Rules of SD Derive C 1. (A & B)  CA 2. AA 3. BA A & B 5. C  E

Rules of SD Derive C 1. (A & B)  CA 2. AA 3. BA A & B2, 3 &I 5. C1, 4  E

Rules of SD Here is the rule  I P____Q P  Q  I P  Q  I Remember: all subderivations must be discharged in exactly the way allowed by a rule!

Derivation strategies Derive A  C 1. A  BA 2. B  C A AA B  E 5. C  E 6. A  C  i

Derivation strategies Derive A  C 1. A  BA 2. B  C A AA B 1, 3  E 5. C 2, 4  E 6. A  C 3-5  i

Rules of SD: vI P or P P v QQ v P

Rules of SD: vI Derive G v H 1. B  GA 2. C & B A B 4. G 5. G v HvI

Rules of SD: vI Derive G v H 1. B  GA 2. C & B A B2 &E 4. G1, 3  E 5. G v H4 vI

Rules of SD: vE P v Q P v Q P---RQ---RR

Rules of SD: vE Derive H 1. G v HA 2. G  HA 3. H  HA GA ---H HAHAHAHA---H H vE

Rules of SD: vE Derive H 1. G v HA 2. G  HA 3. H  HA GA H2, 4  E 6. HA H6 R 8. H 4-5, 6-7 vE

Rules of SD:  E P  Q ORP  Q P  Q ORP  Q PQ PQ Q P  Q P  E

Rules of SD:  E Derive ~M & B 1. C  ~MA 2. C & B A C&E 4. ~M  E 5. B&E 6. ~M & B&I

Rules of SD:  E Derive ~M & B 1. C  ~MA 2. C & B A C2 &E 4. ~M1, 3  E 5. B2 &E 6. ~M & B4, 5 &I

Rules of SD:  i P Q Q P P  Q P  Q

Rules of SD:  I Derive C  D 1. C  DA 2. D  CA C A D 5. DA C 7. C  D  I

Rules of SD:  I Derive C  D 1. C  DA 2. D  CA C A D1, 3  E 5. DA C2, 5  E 7. C  D3-4, 5-6 I

Rules of SD: ~I P Q~Q ~P ~I ~P ~I Both ~ rules make use of recductio ad absurdum

Rules of SD: ~I Derive ~G 1. G  CA 2. ~C & BA GA C 5. ~C 6. ~G~I

Rules of SD: ~I Derive ~G 1. G  CA 2. ~C & BA GA C1, 3  E 5. ~C2 &E 6. ~G3-5 ~I

Rules of SD: ~E ~P ~P Q~Q P ~E P ~E

Rules of SD: ~E Derive A & B 1. ~(A & B)  CA 2. A  ~CA 3. AA ~(A & B) C 6. ~C 7. A & B~E

Rules of SD: ~E Derive A & B 1. ~(A & B)  CA 2. A  ~CA 3. AA ~(A & B)A C1, 4,  E 6. ~C 2, 3  E 7. A & B4-6 ~E