Lectures 8-9 Ling 442. Exercises (1) Reconstruct the original English sentence for each: 1.|birds  fly| > ½ |birds| 2.dog  bite  {} 3.student  study_hard.

Slides:



Advertisements
Similar presentations
Predicate Logic Colin Campbell. A Formal Language Predicate Logic provides a way to formalize natural language so that ambiguity is removed. Mathematical.
Advertisements

The Logic of Quantified Statements
First-Order Logic (and beyond)
Semantics (Representing Meaning)
Albert Gatt LIN3021 Formal Semantics Lecture 9. In this lecture Noun phrases as generalised quantifiers: some further concepts.
CAS LX 502 8a. Formal semantics Truth and meaning The basis of formal semantics: knowing the meaning of a sentence is knowing under what conditions.
1 Conditional XPath, the first order complete XPath dialect Maarten Marx Presented by: Einav Bar-Ner.
Focus affected quantification in adult and child langage Erik-Jan Smits Semantics in the Netherlands Day Utrecht University of Groningen, Dutch.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
March 5: more on quantifiers We have encountered formulas and sentences that include multiple quantifiers: Take, for example: UD: People in Michael’s office.
Week 13a. QR CAS LX 522 Syntax I. Quantifiers We interpret Bill saw everyone as We interpret Bill saw everyone as For every person x, Bill saw x. For.
Domain restriction in child language Erik-Jan Smits 1, Tom Roeper 2 and Bart Hollebrandse 1 1 University of Groningen, The Netherlands 2 University of.
Discrete Structures Chapter 3: The Logic of Quantified Statements
Discrete Structures Chapter 3: The Logic of Quantified Statements
Ch 1.3: Quantifiers Open sentences, or predicates, are sentences that contain one or more variables. They do not have a truth value until variables are.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Meaning and Language Part 1.
Survey of Mathematical Ideas Math 100 Chapter 3, Logic
Lecture 19 Ling 442. Exercises 1.Provide logical forms for the following: (a)Everything John does is crazy. (b)Most of what happened to Marcia is funny.
Lecture 6 Ling 442. Exercises (part 1) Why do the following two sentences have the same truth conditions? (1)You must not smoke here. (2)You may not smoke.
Predicates and Quantifiers
February 2009Introduction to Semantics1 Logic, Representation and Inference Introduction to Semantics What is semantics for? Role of FOL Montague Approach.
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
HELLO THERE !.... It's great to see you ! And by the way, did you know about the previous expression ?
Lecture 13 Ling 442. Exercises (part 1) (1) p. 173 Classify the predicates into four different types. a.The door [creaked open]. b.Sam [got the joke]
More work with pronouns Identify me sentences Singular or plural
Lecture 7 Natural Language Determiners Ling 442. exercises 1. (a) is ambiguous. Explain the two interpretations. (a)Bill might have been killed. 2. Do.
MATH 110 Sec 3-1 Lecture on Statements and Connectives STATEMENT: A declarative sentence that is either TRUE or FALSE (but not both at once).
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
Semantic Construction lecture 2. Semantic Construction Is there a systematic way of constructing semantic representation from a sentence of English? This.
Interpreting Language (with Logic)
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
Key Concepts Representation Inference Semantics Discourse Pragmatics Computation.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
Propositional Logic Predicate Logic
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
ece 627 intelligent web: ontology and beyond
Lecture 1 Ling 442.
Albert Gatt LIN3021 Formal Semantics Lecture 3. Aims This lecture is divided into two parts: 1. We make our first attempts at formalising the notion of.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Lecture 10 (de re/de dicto) Ling 442. Exercises Translate the following into the logical language w/ restricted quantifiers. 1.Every dog that has a bone.
EEL 5937 Content languages EEL 5937 Multi Agent Systems Lecture 10, Feb. 6, 2003 Lotzi Bölöni.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Quantified sentences TP NPT’ Det N’ every man smokes i.|| man || t (u) = 1 iff u  {x: x is a man in t} ii.|| smoke || t (u) = 1 iff u  {x: x smokes in.
Lecture 12 Ling Exercises (part 1) 1.Provide two scenarios for the two readings of the definite DP in the following sentence (and say which is.
Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.
Lecture 2 Ling 442. Review/Preview Qs 1. What does our theory of semantics say about the following two syntactic categories? I.e. what semantic entities.
Lecture 3 Ling 442. exercises 1.What is the difference between implicature and entailment? 2.What is the difference between presuppositions and entailments?
Lecture 1-3: Quantifiers and Predicates. Variables –A variable is a symbol that stands for an individual in a collection or set. –Example, a variable.
tautology checking continued
Logic II CSE 140 etc..
Lecture 5 (Modality) Ling 442.
Semantics (Representing Meaning)
CS201: Data Structures and Discrete Mathematics I
Chapter 1 Logic and Proof.
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Statements and Quantifiers
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Predicates and Quantifiers
Chapter 1: Propositional and First-Order Logic
CS201: Data Structures and Discrete Mathematics I
Statements and Logical Connectives
Logical and Rule-Based Reasoning Part I
Introduction to Computational Linguistics
Propositional Satisfiability
Presentation transcript:

Lectures 8-9 Ling 442

Exercises (1) Reconstruct the original English sentence for each: 1.|birds  fly| > ½ |birds| 2.dog  bite  {} 3.student  study_hard 4.politician  honest = {} 5.|girl  is_talking|  = 3

Exercises (2) Some extra stuff: 1.bark  dog 2.|person| < ½ |cow| 3.|king_of_France| = 1 and king_of_France  bald Represent the truth conditions in terms of the set-theoretic notation. 1.More than three phonologists gathered. 2.The three phonologists gathered.

Exercises (3) Downward entailingness Negative polarity items Everyone who has even been to A will want to go back. Similarly for someone and no one Which positions accept negative polarity items like ever?

Exercises (4) What determiners are strong/weak? every, no, some, most, three, several Kearns asks us to check whether you can switch the two sets (the denotations of CN and VP) to obtain the same truth conditions.

Exercises (5) What is the difference between (1) and (2)? (1)He got on his horse and rode into the sunset. (2) He rode into the sunset and got on his horse. How do you represent the following in Predicate Logic? (3) Bill and Mary met in Seattle. (4) Bill and Mary are a nice couple.

Exercises (6) Let’s talk about exercise (17) on p Translate each sentence into Predicate Logic. (1)Clive gave every child a biscuit or a Batman comic. (2)There’s no business like show business. Translate into PL with modal operators. (3)If wishes were horses beggars would ride.

Exercise (7) Represent each sentence using set-theoretic symbols. (1)None of the ten bombs exploded. (2)All the three candidates showed up. What’s wrong with the following? (3) [every x: student (x) & [a y: paper (y)]] submitted (x, y)

A language w/ restricted Q Most birds fly. Most x [bird(x)  fly (x)] (does not work) From now on, we will use a language that allows us to write: [most x: bird (x)] fly(x) Its truth conditions are exactly the same as the original English sentence. This notation allows us to represent scope interactions of quantifiers too.

Scope ambiguity Every boy likes some rock star. 1.[every x: boy(x)][some y: rock star (y)][likes (x, y)] 2.[some y: rock star (y)][every x: boy(x)][likes (x, y)]

“Strong” vs. “Weak” Determiners This distinction is due to G. Milsark The existential construction (There be …) can be used as a test. OK: There is/are Det CN  weak Det weak DPs: cardinal and non-presuppositional No good: There is/are Det CN  strong Det srong DPs: proportional and presuppositional

Ambiguity Many and few are ambiguous between strong and weak interpretations. 1.No flies and few fleas survived. (strong) 2.Lee found (very) few fleas. (weak) 3.Many students preferred assignments to tests. (strong?) 4.Many people are out there. (weak)

Different types of there BE constructions Basic existential Indicating location Presentational there BE Task there BE List there BE

Russell’s the Russell’s contention: the is not presuppositional. The CN VP = true iff |CN| = 1 and CN  VP IF the CN is in the plural form, then the truth conditions are |CN| > 1 and CN  VP

Frege’s the The CN VP has a true value only if |CN| = 1 If this condition is met, then The CN VP = true iff CN  VP

Caveats (69) and (70) are not semantically. You need to modify them as follows: [several x: car (x)][the y: garage (y) & for (y, x)] ~ leave (x, y) [the y: garage (y)][several x: car (x) & in (x, y)[ ~ leave (x, y) Ignore 6.10