LIN241H1 Lecture Notes - Lecture 6: Truth Condition, Atomic Sentence, Parse Tree
Document Summary
[[x and y]] = 1 iff [[x]] = [[y]] = 1. [[x or y]] = 1 iff it is not the case that [[x]] = [[y]] = 0. For any two clauses x and y: (cr) [[x and y]] = min([[x]],[[y]]) (dr) [[x or y]] = max([[x]],[[y]]) Remember that these rules can be expressed as truth-tables. Use a toy grammar that only captures coordination and negation of clauses: does not assign clauses to atomic clauses, refers to any clause in english that is not made up of other clauses due to coordination etc. Call this grammar eprop: has two aspects: set of syntactic rules and set of semantic rules. The syntax is a context free grammar. Looking at one rule: (r1) s -> s conj s: s is a category symbol. In eprop, atomic sentences are treated as if they had no internal structure.
