Hamblin Semantics & Focus
|
|
- Jessie Hill
- 5 years ago
- Views:
Transcription
1 LING 147. emantics of Questions Week 3 Yimei Xiang eptember 15, 2016 Last week I. Generalized quantifiers Hamblin emantics & Focus quantificational DPs are generalized quantifiers, which denote sets of sets (of type xet, ty); quantificational determiners denote relation between sets (of type xet, etty). (1) a. every cat λp xe,ty.@xrcat 1 pxq Ñ P pxqs b. some cat λp xe,ty.dxrcat 1 pxq ^ P pxqs (2) a. every = λq xe,ty λp xe,ty.@xrqpxq Ñ P pxqs b. some = λq xe,ty λp xe,ty.dxrqpxq ^ P pxqs ome shifting operations: (i) individuals (of type e) can also be shifted into generalized quantifiers via type-lifting; (ii) the quantification domain of an D-quantifier can be extracted via the BE-shifter. (3) a. LIFT λα τ λp xτ,ty.p pαq b. LIFTp John q λp xe,ty.p pjq (4) a. BE λpλzrppλy.y zqs b. BEp some cat cat 1 Quantifier raising and other phrasal LF movement: A. B. C. everyone VP Mary will VP α τ /α xτt,ty Mary saw x x come... x τ... II. Categorial approaches of question semantics Core assumptions: (i) short answers are bare nominal; (ii) questions denote lambda abstracts; (iii) wh-items denote lambda operators. (5) a. who came rpeople 1 pxq.came 1 pxqs b. who λp rpeople 1 pxq.p pxqs Advantages: (i) the relation between questions and short answers is very directly modeled; (ii) similarity of wh-questions and free relatives is captured nicely. Problems: (i) composing multi-wh questions suffers type mismatch; (ii) it assigns different semantic types to different questions, which makes it difficult account for question coordinations; (iii) it doesn t account for the existential semantics of wh-words in non-interrogative sentences. [But we also saw that those problems can be overcome.] 1
2 III. Intensionality The extension of an expression is world-dependent. The intension of an expression X is a function which applies to a possible world and returns the extension of X in that world. (6) a. X w ( the extension of X in w ) b. λw. X w ( the intension of X ) The intension of a sentence is a proposition: a function from worlds to truth values. The intension of a predicate of type xe, ty is a property: a function from worlds to xe, ty functions. The intension of a definite NP is an individual concept: a function from worlds to entities. Propositions can also be viewed as the set of possible worlds where this proposition is true. Hence, we can use set-theoretical operations to represent the following relations and operations: Relations and operations p entails q p contradicts q p and q p or q p is possible p is necessary et-theoretical notations p Ď q p X q p X q p Y q p p W Plan for today Intensionality (cont.) Hamblin emantics of questions 2
3 1 Intensionality (cont.) The extension of a proper name or a logical expression is not world-dependent. (7) a. For every w, John w j (controversial) b. For every w, it is not the case that w λp xs,ty λw. p w c. For every w, every w λq xe,ty λp xe,ty.@xrqpxq Ñ P pxqs Intensional-izing the theory of types (8) Types 1 a. Basic types: e (individuals/entities) and t (truth values). b. Functional types: If σ and τ are types, then xσ, τy is a type. c. Intensional types: If σ is a type, then xs, σy is an intensional type. (9) Domains a. D s W b. D xσ,τy tf f : D σ Ñ D τ u (functions from things of type σ to things of type τ) c. D xs,τy tf f : W Ñ D τ u (functions from possible worlds to things of type τ) Intensional-izing the theory of semantic composition (10) Intensional Functional Application If {β, γ} is the set of α s daughters, β P D xxs,σy,τy, and γ P D σ, then α β pλw. γ w q Example: (11) John believes that Mary left. 2 John 1 believes xst,ety that 1 Mary a. 1 left 1 pmq b. believe λp xs,ty e.believe 1 px, pq c. 1 believe pλw. 1 w q By IFA e.believe 1 px, λw.left 1 wpmqq d. 2 1 p John q by FA p e.believe 1 px, λw.left 1 wpmqqqpjq believe 1 pj, λw.left 1 wpmqq left Alternatively, we can assume that the predicate left carries an world variable w, which is then abstracted over by a λ-operator. (ee Percus 2000 Constraints on some other variables in syntax.) (11 1 ) John 1 believes xst,ety λw.left 1 wpmq λw left 1 wpmq Mary left w 1 Note that we are not actually adding s for possible worlds to our type theory. This is because (as far as we ve seen) there are no expressions of natural language that have specific possible worlds as their values 3
4 Discussion: (i) in (11 1 ), what composition rule is used for node 1? (ii) Compare the following LFs. Given the lexical entry of every in (7c), consider, which LF is well-formed? (12) Mary saw everyone. everyone λw everyone λw λw everyone Mary saw w x Mary saw w x Mary saw w x 2 Hamblin emantics of questions (Hamblin 1973) 2.1 Core assumptions A possible answer denotes a proposition. A short answer is an elliptical form of the corresponding full answer. (13) Who came? a. Mary came. (full answer) b. Mary came. (short answer) A wh-item denotes a set of individuals. (14) a. who tx : human 1u b. what tx : thing pxq 1u c. which tx : cat pxq 1u A question denotes the set of propositions that are possible (direct) answers of this question, called a Hamblin (alternative) set. (15) a. who came? ta came, b came, a and b came,...u b. which person likes which person? ta likes b, b likes a,...u c. Did John come? tjohn came, John didn t comeu d. Does Mary like coffee or tea? ALT-Q tmary likes coffee, Mary likes teau e. Does Mary like coffee or tea? Y/N-Q tmary likes coffee or tea, Mary doesn t like coffee or teau f. How many cats does John have? tjohn has one cat, John has two cats,...u Hamblin sets are composed via Point-wise Functional Application. (16) Point-wise Functional Application If α is of type xσ, τy and β is of type σ, then a. α Ď D xσ,τy b. β Ď D σ c. αpβq is of type τ, and αpβq tapbq a P α ^ b P β u 4
5 2.2 Composing questions using Hamblin emantics Composing declaratives and wh-questions: A proper name Mary denotes a singleton set; thus a declarative denotes a singleton set. A wh-item denotes a set with many individuals, thus a wh-question denotes a set with many propositions. (17) a. Mary came. b. Who came? tλw.came 1 wpmqu tλw.came 1 wpxq : human 1u Mary tmu came t.came 1 wpxqu who tx : human 1u came t.came 1 wpxqu A note on wh-movement: In categorial approaches (and Karttunen emantics), (non-subject) whitems must undertake movement, so as to salvage type-mismatch. For wh-insitu languages (e.g., Chinese), categorial approaches and Karttunen semantics predicts covert movement of the wh-item. Hamblin emantics has no such prediction. Composing polar questions: Is it the case that denotes the set with the identity function on the question nucleus and its negation. (18) Is it the case that John left? tλw.left 1 wpjq, λw. left 1 wpjqu is it the case that tλp.p, λpλw. p w u tλw.left 1 wpjqu John left Exercise: Assume the type-shifted lexical entry of or in (19), derive the Hamblin sets of the alternative question in (20) using PFA. (19) or λα xst,ty λβ xst,ty.α Y β ( or applies to two sets of propositions, and returns the union of these two sets.) (20) Did JOHN come or MARY come? ALT-Q Exercise: Compose the following polar-q. [Consider: can we use the lexical entry of or in (19)?] (21) Is it the case that [[John came] or [Mary came]]? 5
6 2.3 Compare Hamblin emantics and traditional categorial approaches Discussion: Are the denotations of (22a-b) equivalent under Hamblin emantics? What about under categorial approaches? [Recall that categorial approaches assume that questions denote lambda abstracts.] (22) a. Did JOHN come or MARY come? ALT-Q b. [Among John and Mary,] which person came? Discussion: Can we derive a Hamblin set based on a lambda abstract? What about retrieving a lambda abstract out of the corresponding Hamblin set? An inclusive comparison between categorial approaches and Hamblin emantics Categorial approaches Hamblin emantics Retrieving the question nucleus Yes No Getting short answers Yes No Getting full answers Yes Yes Uniform semantic type No Yes: xst, ty Question coordinations No No Type-driven wh-movement Yes No Although Hamblin emantics treat questions uniformly as of type xst, ty, it still has imperfections in analyzing question coordinations. Conjunction is traditionally treated as set-intersection. (23) John left and Mary stayed John left X Mary stayed But, the conjunction of two questions cannot be the intersection of the Hamblin sets of the two questions: (24) who left and who stayed who left X who stayed H NO WAY! Hence, Hamblin emantics has to define conjunction as pointwise intersection. 2 (25) Q 1 and Q 2 tp X q : p P Q 1 ^ q P Q 2 u 2 Inquisitive emantics maintains the basic intersection semantics of conjunction by treating questions as sets of proposition sets. (ee Ciardelli et al. 2016, Composing Alternatives ) 6
7 3 Alternatives emantics of focus (Rooth 1992) Focus affects the suitability of a sentence as answer of the given question. Observe the prosodic dependence between questions and answers: (26) Who invited Bill? Core definitions a. JOHN invited Bill. b. # John invited BILL. c. # JOHN invited BILL. (27) Every expression α has an ordinary value α 0 and a focus value α f. a. α 0 is simply the truth value of α (i.e., the one that we already know). b. α f is the set of all ordinary semantic values obtained by substituting alternatives for any F-marked subparts of α. Compute the focus value compositionally: (28) Terminal " nodes (TN) t α 0 u if α is focused α F if α is not focused D typep α 0 q Pointwise Functional Application (PFA) αpβq f tapbq a P α f, b P β f u Exercise: Compute the focus value of the following sentences compositionally: (29) JOHN F invited Bill. JOHN F invited Bill Use the Rooth-style terms to define Hamblin sets: 3 (30) a. who 0 is undefined b. who f tx : human 1u c. [ TP who came] 0 is undefined d. [ TP who came] f tλw.came 1 wpxq : human 1u e. C r`whs [TP] 0 TP f (Beck & Kim 2006, see also himoyama 2001) (interrogative C 0 returns the focus-semantic value of TP as the ordinary semantic value of CP.) 3 Principle of Interpretability: An LF must have an ordinary semantic value (Beck 2006: p. 16) 7
8 Exercise: Use the following toy LF to derive the Hamblin set for Who does John like?. (31) CP C TP John invited who Explain the prosodic dependence between questions and answers: (32) Question-Answer Congruence (Rooth 1992: 86) A sentence is a possible answer of a question Q iff Q 0 Ď f Examples: (33) a. who invited Bill? 0 Ď JOHN F invited Bill f b. Did JOHN or MARY invited Bill? 0 Ď JOHN F invited Bill f 8
Karttunen Semantics. Last week. LING 147. Semantics of Questions Week 4 Yimei Xiang September 22, I. Intensionality
LING 147. Semantics of Questions Week 4 Yimei Xiang September 22, 2016 Last week I. Intensionality Karttunen Semantics The intension of an expression X is a function which applies to a possible world and
More informationGeneralized Quantifiers & Categorial Approaches & Intensionality
LING 147. Semantics of Questions Week 2 Yimei Xiang September 8, 2016 Last week Generalized Quantifiers & Categorial Approaches & Intensionality The semantics of questions is hard to characterize directly.
More informationLing 98a: The Meaning of Negation (Week 5)
Yimei Xiang yxiang@fas.harvard.edu 15 October 2013 1 Review Negation in propositional logic, oppositions, term logic of Aristotle Presuppositions Projection and accommodation Three-valued logic External/internal
More informationSpring 2018 Ling 620 Introduction to Semantics of Questions: Questions as Sets of Propositions (Hamblin 1973, Karttunen 1977)
Introduction to Semantics of Questions: Questions as Sets of Propositions (Hamblin 1973, Karttunen 1977) 1. Question Meanings and Sets of Propositions (1) The Semantics of Declarative Sentence Dave smokes
More informationComposing questions: A hybrid categorial approach
Composing questions: A hybrid categorial approach Yimei Xiang Harvard University yxiang@fas.harvard.edu Compositionality Workshop, GLOW 40, Leiden University Roadmap 1 Why pursing a categorial approach?
More informationThe Semantics of Questions Introductory remarks
MIT, September-October 2012 1 1. Goals for this class The Semantics of Questions Introductory remarks (1) a. Which boy (among John, Bill and Fred) read the book? Uniqueness presupposition (UP): exactly
More informationSemantics and Generative Grammar. An Introduction to Intensional Semantics 1
An Introduction to Intensional Semantics 1 1. The Inadequacies of a Purely Extensional Semantics (1) Our Current System: A Purely Extensional Semantics The extension of a complex phrase is (always) derived
More informationIntroduction to Semantics. The Formalization of Meaning 1
The Formalization of Meaning 1 1. Obtaining a System That Derives Truth Conditions (1) The Goal of Our Enterprise To develop a system that, for every sentence S of English, derives the truth-conditions
More informationSpring 2018 Ling 620 The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1
The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1 1. The Inadequacies of a Purely Extensional Semantics (1) Extensional Semantics a. The interpretation
More informationlist readings of conjoined singular which -phrases
list readings of conjoined singular which -phrases Andreea C. Nicolae 1 Patrick D. Elliott 2 Yasutada Sudo 2 NELS 46 at Concordia University October 18, 2015 1 Zentrum für Allgemeine Sprachwissenschaft
More informationSemantics I, Rutgers University Week 3-1 Yimei Xiang September 17, Predicate logic
Semantics I, Rutgers University Week 3-1 Yimei Xiang September 17, 2018 Predicate logic 1. Why propositional logic is not enough? Discussion: (i) Does (1a) contradict (1b)? [Two sentences are contradictory
More informationPresuppositions (introductory comments)
1 Presuppositions (introductory comments) Some examples (1) a. The person who broke the typewriter was Sam. b. It was Sam who broke the typewriter. c. John screwed up again. d. John likes Mary, too. e.
More informationBasics of conversational implicatures
Semantics I, Rutgers University Week 12 Yimei Xiang November 19, 2018 1. Implication relations Basics of conversational implicatures Implication relations are inferential relations between sentences. A
More informationProseminar on Semantic Theory Fall 2010 Ling 720. Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification
1. Introduction Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification (1) The Importance of Scha (1981/1984) The first modern work on plurals (Landman 2000) There are many ideas
More informationSemantics and Generative Grammar. A Little Bit on Adverbs and Events
A Little Bit on Adverbs and Events 1. From Adjectives to Adverbs to Events We ve just developed a theory of the semantics of adjectives, under which they denote either functions of type (intersective
More informationSpring 2017 Ling 620. The Semantics of Modals, Part 3: The Ordering Source 1
1. On Our Last Episode The Semantics of Modals, Part 3: The Ordering Source 1 We developed a semantics for modal auxiliaries in English, that achieved the goals in (1). (1) Overarching Analytic Goal A
More informationIntroduction to Semantics. Pronouns and Variable Assignments. We ve seen that implicatures are crucially related to context.
Pronouns and Variable Assignments 1. Putting this Unit in Context (1) What We ve Done So Far This Unit Expanded our semantic theory so that it includes (the beginnings of) a theory of how the presuppositions
More informationParasitic Scope (Barker 2007) Semantics Seminar 11/10/08
Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08 1. Overview Attempts to provide a compositional, fully semantic account of same. Elements other than NPs in particular, adjectives can be scope-taking
More informationSemantics and Generative Grammar. Quantificational DPs, Part 2: Quantificational DPs in Non-Subject Position and Pronominal Binding 1
Quantificational DPs, Part 2: Quantificational DPs in Non-Subject Position and Pronominal Binding 1 1. Introduction (1) Our Current System a. The Ds no, some, and every are type (Quantificational
More informationLing 130 Notes: Syntax and Semantics of Propositional Logic
Ling 130 Notes: Syntax and Semantics of Propositional Logic Sophia A. Malamud January 21, 2011 1 Preliminaries. Goals: Motivate propositional logic syntax and inferencing. Feel comfortable manipulating
More informationRaising and resolving issues with scalar modifiers
Semantics & Pragmatics Volume 6, Article 3: 1 57, 2013 http://dx.doi.org/10.3765/sp.6.3 Raising and resolving issues with scalar modifiers Elizabeth Coppock University of Gothenburg Thomas Brochhagen University
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationSpring 2017 Ling 620. An Introduction to the Semantics of Tense 1
1. Introducing Evaluation Times An Introduction to the Semantics of Tense 1 (1) Obvious, Fundamental Fact about Sentences of English The truth of some sentences (of English) depends upon the time they
More informationSemantics and Generative Grammar. Quantificational DPs, Part 3: Covert Movement vs. Type Shifting 1
Quantificational DPs, Part 3: Covert Movement vs. Type Shifting 1 1. Introduction Thus far, we ve considered two competing analyses of sentences like those in (1). (1) Sentences Where a Quantificational
More informationSpring 2017 Ling 620 Eliminating Res-Movement : An Introduction to Concept Generators
Eliminating Res-Movement : An Introduction to Concept Generators Our analysis of de re readings was built upon the notion that DPs can undergo a crazy operation of res-movement, which serves to move them
More informationGeneralized Quantifiers Logical and Linguistic Aspects
Generalized Quantifiers Logical and Linguistic Aspects Lecture 1: Formal Semantics and Generalized Quantifiers Dag Westerståhl University of Gothenburg SELLC 2010 Institute for Logic and Cognition, Sun
More informationQuantification: Quantifiers and the Rest of the Sentence
Ling255: Sem & Cogsci Maribel Romero February 17, 2005 Quantification: Quantifiers and the Rest of the Sentence 1. Introduction. We have seen that Determiners express a relation between two sets of individuals
More informationThe Semantics of Definite DPs 1. b. Argument Position: (i) [ A politician ] arrived from Washington. (ii) Joe likes [ the politician ].
The Semantics of Definite DPs 1 Thus far, our semantics is able to interpret common nouns that occupy predicate position (1a). However, the most common position for common nouns to occupy is internal to
More informationSemantics and Generative Grammar. The Semantics of Adjectival Modification 1. (1) Our Current Assumptions Regarding Adjectives and Common Ns
The Semantics of Adjectival Modification 1 (1) Our Current Assumptions Regarding Adjectives and Common Ns a. Both adjectives and common nouns denote functions of type (i) [[ male ]] = [ λx : x D
More informationIntroduction to the semantics of questions
Introduction to the semantics of questions Radek Šimík University of Potsdam, SFB 632 simik@uni-potsdam.de EGG summer school, July 25 29, 2011, České Budějovice 2 Contents 1 Introduction 5 1.1 Questions
More informationLING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic
LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, 2016 Propositional logic 1 Vocabulary of propositional logic Vocabulary (1) a. Propositional letters: p, q, r, s, t, p 1, q 1,..., p 2, q 2,...
More informationSemantics and Generative Grammar. Pronouns and Variable Assignments 1. We ve seen that implicatures are crucially related to context.
Pronouns and Variable Assignments 1 1. Putting this Unit in Context (1) What We ve Done So Far This Unit Expanded our semantic theory so that it includes (the beginnings of) a theory of how the presuppositions
More informationIntensional semantics: worlds, modals, conditionals
Intensional semantics: worlds, modals, conditionals 1 Limitations of the actual world Recall some assumptions we have followed in this class: Sentences are conditional truth values ( 1 iff truth condition]
More informationQuantification in the predicate calculus
Quantification in the predicate calculus PHIL 43916 eptember 5, 2012 1. The problem posed by quantified sentences... 1 2. yntax of PC... 2 3. Bound and free iables... 3 4. Models and assignments... 4 5.
More information564 Lecture 25 Nov. 23, Continuing note on presuppositional vs. nonpresuppositional dets.
564 Lecture 25 Nov. 23, 1999 1 Continuing note on presuppositional vs. nonpresuppositional dets. Here's the argument about the nonpresupp vs. presupp analysis of "every" that I couldn't reconstruct last
More informationTwo Reconstruction Puzzles Yael Sharvit University of Connecticut
Workshop on Direct Compositionality June 19-21, 2003 Brown University Two Reconstruction Puzzles Yael Sharvit University of Connecticut yael.sharvit@uconn.edu Some constructions exhibit what is known as
More informationFocus in complex noun phrases
Focus in complex noun phrases Summary In this paper I investigate the semantics of association with focus in complex noun phrases in the framework of Alternative Semantics (Rooth 1985, 1992). For the first
More informationEmbedded interrogatives: the role of false answers
1 Introduction Embedded interrogatives: the role of false answers Floris Roelofsen Nadine Theiler Maria Aloni Questions in Discourse workshop, Göttingen, September 18, 2014 Consider the following sentence:
More informationIntensionality. 1. Intensional Propositional Logic (IntPL).
Ling255: Sem and CogSci Maribel Romero April 5, 2005 1. Intensional Propositional Logic (IntPL). Intensionality Intensional PL adds some operators O to our standard PL. The crucial property of these operators
More informationTwo Reconstruction Puzzles Yael Sharvit University of Connecticut
Workshop on Direct Compositionality June 19-21, 2003 Brown University Two Reconstruction Puzzles Yael Sharvit University of Connecticut yael.sharvit@uconn.edu Some constructions exhibit what is known as
More informationSemantics and Generative Grammar. Expanding Our Formalism, Part 1 1
Expanding Our Formalism, Part 1 1 1. Review of Our System Thus Far Thus far, we ve built a system that can interpret a very narrow range of English structures: sentences whose subjects are proper names,
More informationIntroduction to Semantics. Common Nouns and Adjectives in Predicate Position 1
Common Nouns and Adjectives in Predicate Position 1 (1) The Lexicon of Our System at Present a. Proper Names: [[ Barack ]] = Barack b. Intransitive Verbs: [[ smokes ]] = [ λx : x D e. IF x smokes THEN
More informationPredicates, Quantifiers and Nested Quantifiers
Predicates, Quantifiers and Nested Quantifiers Predicates Recall the example of a non-proposition in our first presentation: 2x=1. Let us call this expression P(x). P(x) is not a proposition because x
More informationPresupposition and Montague Grammar (Krahmer 1998, Ch. 5)
Presupposition and Montague Grammar (Krahmer 1998, Ch. 5) Bern Samko Semantics C (Spring 2010) Semantic analysis of presuppositions requires partialization of Montague grammar. Karttunen & Peters 1979
More informationSolving the dilemma between uniqueness and mention some * Yimei Xiang. Harvard University
Solving the dilemma between uniqueness and mention some * Yimei Xiang Harvard University 1. Introduction Most wh-questions admit only exhaustive answers. For example, to properly answer (1), the addressee
More information1 The standard quantifiers in FOL
Linguistics 661, Issues in Semantics Alexander Williams, 13 February 2007 Basics of quantification 1 The standard quantifiers in FOL First order logic includes the two quantifiers x and x, for any variable
More informationSpring 2017 Ling 620 The Semantics of Control Infinitives: A First Introduction to De Se Attitudes
The Semantics of Control Infinitives: A First Introduction to De Se Attitudes 1. Non-Finite Control Complements and De Se Attitudes (1) Two Sentences that Seem Very Close in Meaning a. Dave expects he
More informationSemantics and Pragmatics of NLP
Semantics and Pragmatics of NLP Alex Ewan School of Informatics University of Edinburgh 28 January 2008 1 2 3 Taking Stock We have: Introduced syntax and semantics for FOL plus lambdas. Represented FOL
More informationIntroducing a hybrid categorial approach
Chapter 1 Introducing a hybrid categorial approach 1.1. Introduction This chapter discusses and re-evaluates the following fundamental issues on question semantics: What does a question denote? What counts
More informationProseminar on Semantic Theory Fall 2013 Ling 720 An Algebraic Approach to Quantification and Lambda Abstraction: Fregean Interpretations 1
An Algebraic Approach to Quantification and Lambda Abstraction: Fregean Interpretations 1 (1) The Disambiguated Language Politics+λ Politics+λ is the disambiguated language γ {Concat,
More informationTwo sets of alternatives for numerals
ECO5 @ Harvard April 11, 2015 Teodora Mihoc, tmihoc@fas.harvard.edu Alexander Klapheke, klapheke@fas.harvard.edu Two sets of alternatives for numerals Contents 1 Preliminaries 1 2 Horn-style alternatives:
More informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
More informationSemantics 2 Part 1: Relative Clauses and Variables
Semantics 2 Part 1: Relative Clauses and Variables Sam Alxatib EVELIN 2012 January 17, 2012 Reviewing Adjectives Adjectives are treated as predicates of individuals, i.e. as functions from individuals
More informationWh-islands in degree questions: A semantic approach
Semantics & Pragmatics Volume 4, Article 5: 1 44, 2011 http://dx.doi.org/10.3765/sp.4.5 Wh-islands in degree questions: A semantic approach Márta Abrusán University of Oxford Received 2010-08-12 / Decision
More informationAn inquisitive approach to occasion-sensitivity
An inquisitive approach to occasion-sensitivity Tamara Dobler ILLC November 6, 2017 Tamara Dobler (ILLC) An inquisitive approach to occasion-sensitivity November 6, 2017 1 / 37 Outline 1 Introduction 2
More information09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor
Martin Henz and Aquinas Hobor October 14, 2010 Generated on Thursday 14 th October, 2010, 11:40 1 Review of Modal Logic 2 3 4 Motivation Syntax and Semantics Valid Formulas wrt Modalities Correspondence
More informationMonads as a Solution for Generalized Opacity
Monads as a Solution for Generalized Opacity Gianluca Giorgolo & Ash Asudeh April 27, 2014 - TTNLS 2014 Denotations vs. senses 1 + 1 = 2 The two sides of the equality have the same denotation But they
More informationProseminar on Semantic Theory Fall 2010 Ling 720 The Basics of Plurals: Part 1 1 The Meaning of Plural NPs and the Nature of Predication Over Plurals
The Basics of Plurals: Part 1 1 The Meaning of Plural NPs and the Nature of Predication Over Plurals 1. Introductory Questions and Guesses (1) Blindingly Obvious Fact about Natural Language There is number
More informationHow to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.
Major results: (wrt propositional logic) How to reason correctly. How to reason efficiently. How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague,
More informationIntroduction to Intensional Logic. Ling 406/802 Read Meaning and Grammar, Ch
Introduction to Intensional Logic Ling 406/802 Read Meaning and Grammar, Ch 51-52 1 Towards Intensional Semantics Extensional semantics that models the meaning of sentences based on the extensions of linguistic
More informationCS 730/730W/830: Intro AI
CS 730/730W/830: Intro AI 1 handout: slides 730W journal entries were due Wheeler Ruml (UNH) Lecture 9, CS 730 1 / 16 Logic First-Order Logic The Joy of Power Wheeler Ruml (UNH) Lecture 9, CS 730 2 / 16
More informationLogic. Readings: Coppock and Champollion textbook draft, Ch
Logic Readings: Coppock and Champollion textbook draft, Ch. 3.1 3 1. Propositional logic Propositional logic (a.k.a propositional calculus) is concerned with complex propositions built from simple propositions
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationProseminar on Semantic Theory Fall 2013 Ling 720 The Proper Treatment of Quantification in Ordinary English, Part 1: The Fragment of English
The Proper Treatment of Quantification in Ordinary English, Part 1: The Fragment of English We will now explore the analysis of English that Montague puts forth in his seminal paper, PTQ. As we ve already
More informationLogic Programming (PLP 11) Predicate Calculus, Horn Clauses, Clocksin-Mellish Procedure
Logic Programming (PLP 11) Predicate Calculus, Horn Clauses, Clocksin-Mellish Procedure Carlos Varela Rennselaer Polytechnic Institute November 7, 2016 C. Varela 1 An Early (1971) Conversation USER: Cats
More informationHomogeneity and Plurals: From the Strongest Meaning Hypothesis to Supervaluations
Homogeneity and Plurals: From the Strongest Meaning Hypothesis to Supervaluations Benjamin Spector IJN, Paris (CNRS-EHESS-ENS) Sinn und Bedeutung 18 Sept 11 13, 2013 1 / 40 The problem (1) Peter solved
More informationAnnouncements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example
Announcements CS243: Discrete Structures Propositional Logic II Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Tuesday 09/11 Weilin s Tuesday office hours are
More informationInquisitive semantics
Inquisitive semantics NASSLLI 2012 lecture notes Ivano Ciardelli University of Bordeaux Floris Roelofsen University of Amsterdam June 25, 2012 Jeroen Groenendijk University of Amsterdam About this document
More informationLING 501, Fall 2004: Quantification
LING 501, Fall 2004: Quantification The universal quantifier Ax is conjunctive and the existential quantifier Ex is disjunctive Suppose the domain of quantification (DQ) is {a, b}. Then: (1) Ax Px Pa &
More informationPropositional Logic: Review
Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or
More informationLogica e Linguaggio. Raffaella Bernardi. March 22, University of Trento
Logica e Linguaggio Raffaella Bernardi University of Trento March 22, 2012 Layout Logical Entailment Logical Entailment in PL Logical Entailment in FoL Sinn und Bedeutung Formal Semantics Main questions
More informationProseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1
Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,
More informationSpring 2017 Ling 620. The Semantics of Modals, Part 2: The Modal Base 1
1. On Our Last Episode The Semantics of Modals, Part 2: The Modal Base 1 (1) The Failure of a Lexical Ambiguity Account Postulating separate lexical entries for all the different readings of a modal misses
More informationContexts for Quantification
Contexts for Quantification Valeria de Paiva Stanford April, 2011 Valeria de Paiva (Stanford) C4Q April, 2011 1 / 28 Natural logic: what we want Many thanks to Larry, Ulrik for slides! Program Show that
More informationCS 730/830: Intro AI. 1 handout: slides. Wheeler Ruml (UNH) Lecture 11, CS / 15. Propositional Logic. First-Order Logic
CS 730/830: Intro AI 1 handout: slides Wheeler Ruml (UNH) Lecture 11, CS 730 1 / 15 Wheeler Ruml (UNH) Lecture 11, CS 730 2 / 15 Logic A logic is a formal system: syntax: defines sentences semantics: relation
More informationFLST: Semantics IV. Vera Demberg FLST: Semantics IV
Vera Demberg vera@coli.uni-sb.de http://www.coli.uni-saarland.de/courses/flst/2011/ Semantic Composition! John likes Mary likejohn, mary) S" " NP" john" VP" " PN" john" V" like"_,"_)"" NP" mary" John likes
More information(5) Ú who á = people context = {John, Mary, } cf. Ú John á = John. knowing who bought what Syntax/Semantics of Questions, March 23, 1999
Some consequences of Paul Hagstrom knowing who bought what Syntax/Semantics of Questions, March 23, 1999 (5) Ú who á = people context = {John, Mary, } cf. Ú John á = John Purportedly, this is about Hagstrom
More informationIntroduction to Logic in Computer Science: Autumn 2006
Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Today s class will be an introduction
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee Topics n Predicates n
More informationPredicate Calculus lecture 1
Predicate Calculus lecture 1 Section 1.3 Limitation of Propositional Logic Consider the following reasoning All cats have tails Gouchi is a cat Therefore, Gouchi has tail. MSU/CSE 260 Fall 2009 1 MSU/CSE
More informationA Review of the Essentials of Extensional Semantics 1
A Review of the Essentials of Extensional Semantics 1 1. The Big Picture (1) Our Ultimate Goal A precise, formal theory of a particular sub-component the human language faculty: the ability to productively
More informationRecall that the expression x > 3 is not a proposition. Why?
Predicates and Quantifiers Predicates and Quantifiers 1 Recall that the expression x > 3 is not a proposition. Why? Notation: We will use the propositional function notation to denote the expression "
More informationProseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1
First Order (Predicate) Logic: Syntax and Natural Deduction 1 A Reminder of Our Plot I wish to provide some historical and intellectual context to the formal tools that logicians developed to study the
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationThe predicate calculus is complete
The predicate calculus is complete Hans Halvorson The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c,
More informationLing 130 Notes: Predicate Logic and Natural Deduction
Ling 130 Notes: Predicate Logic and Natural Deduction Sophia A. Malamud March 7, 2014 1 The syntax of Predicate (First-Order) Logic Besides keeping the connectives from Propositional Logic (PL), Predicate
More informationComp487/587 - Boolean Formulas
Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested
More information1 FUNDAMENTALS OF LOGIC NO.10 HERBRAND THEOREM Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical connectives (,,, ) Truth table Tautology
More informationPredicate Logic. CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo
Predicate Logic CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 22 Outline 1 From Proposition to Predicate
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationCSE 1400 Applied Discrete Mathematics Definitions
CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine
More informationSection Summary. Section 1.5 9/9/2014
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers Translated
More informationAnnouncements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication
Announcements CS311H: Discrete Mathematics Propositional Logic II Instructor: Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Wed 09/13 Remember: Due before
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs
More informationSpring 2012 Ling 753 A Review of Some Key Ideas in the Semantics of Plurals. 1. Introduction: The Interpretations of Sentences Containing Plurals
A Review of Some Key Ideas in the Semantics of Plurals 1. Introduction: The Interpretations of Sentences Containing Plurals (1) Overarching Questions What are the truth-conditions of sentences containing
More informationLIN1032 Formal Foundations for Linguistics
LIN1032 Formal Foundations for Lecture 5 Albert Gatt In this lecture We conclude our discussion of the logical connectives We begin our foray into predicate logic much more expressive than propositional
More informationKB Agents and Propositional Logic
Plan Knowledge-Based Agents Logics Propositional Logic KB Agents and Propositional Logic Announcements Assignment2 mailed out last week. Questions? Knowledge-Based Agents So far, what we ve done is look
More informationPropositional Logic and Semantics
Propositional Logic and Semantics English is naturally ambiguous. For example, consider the following employee (non)recommendations and their ambiguity in the English language: I can assure you that no
More informationCOMP9414: Artificial Intelligence First-Order Logic
COMP9414, Wednesday 13 April, 2005 First-Order Logic 2 COMP9414: Artificial Intelligence First-Order Logic Overview Syntax of First-Order Logic Semantics of First-Order Logic Conjunctive Normal Form Wayne
More informationIt is not the case that ϕ. p = It is not the case that it is snowing = It is not. r = It is not the case that Mary will go to the party =
Introduction to Propositional Logic Propositional Logic (PL) is a logical system that is built around the two values TRUE and FALSE, called the TRUTH VALUES. true = 1; false = 0 1. Syntax of Propositional
More information