PHLB50H3 Lecture Notes - Lecture 3: Exclusive Or, Logical Biconditional, The Butler
Document Summary
Moder(cid:374) sy(cid:373)(cid:271)oli(cid:272) logi(cid:272) week 3: sl a(cid:374)d sy(cid:373)(cid:271)olizatio(cid:374) co(cid:374)t"d. I"ll (cid:272)olle(cid:272)t a(cid:374)(cid:455) that ha(cid:448)e(cid:374)"t (cid:271)ee(cid:374) ha(cid:374)ded i(cid:374) (cid:455)et (cid:374)o(cid:449) Last week, we set up the language of sentential logic (sl). We also began to look at making translations between the symbolic language of sl, and natural language (in this case, english) And we introduced a couple of ways of talking about sl: truth tables, and , . Remember that symbolization is a three step process: identify the simple/atomic sentences, highlight, and paraphrase the connectives, convert the paraphrase to symbols. This works fairly well for when the antecedent/consequent relationship is clear. It is not the case that sherlock takes the subway only if sherlock can find a cab. Given the symbolization scheme: s: sherlock takes the subway, t: sherlock can find a cab. How should we symbolize this: 1) s t, 2) (s t)