Non-canonical comparatives: Syntax, semantics, & processing

Size: px
Start display at page:

Download "Non-canonical comparatives: Syntax, semantics, & processing"

Transcription

1 Non-canonical comparatives: Syntax, semantics, & processing ESSLLI 2018 Roumyana Pancheva, Alexis Wellwood University of Southern California August 15, / 22

2 cardinality comparison Two generalizations about nominal comparatives (1) a. I bought more coffee than you did. volume, weight, *temperature b. I bought more coffees than you did. cardinality, *volume, *weight Monotonicity (Schwarzschild 2002, 2006) Comparatives with bare Ns show variable but constrained dimensionality, sensitive to part-whole relations. Number (Hackl 2001, Bale & Barner 2009) Comparatives with plural NPs may only be compared by number. There is a class of apparent counter-examples, the so-called mass plurals (e.g., muds). See Acquaviva 2008, Schwarzschild 2012, Solt 2015, among others. 2 / 22

3 Two generalizations about verbal comparatives The generalizations hold for VPs as well (Wellwood et al. 2012) (2) a. as much coffee volume, weight, *temperature b. too many coffees cardinality, *volume, *weight (3) a. run on the track as much distance, duration, *speed b. run to the track more/as many times cardinality, *distance, *duration 3 / 22

4 Capturing the monotonicity constraint Permissible values of the measure function µ encoded in many and much must be S(chwarzschild)-monotonic. S-monotonicity (Schwarzschild 2002, 2006) x, y D P, if x P y, then µ(x) < µ(y). (4) Let coffee = {..., c, c, c c,...} = D C (where c, c, etc. are non-atomic) Intuitively, for any x, y D C such that x P y, a. volume(x) < volume(y) b. weight(x) < weight(y) c. temperature(x) temperature(y) (5) Let coffees = {..., c, c, c c,...} = D C (where c, c, etc. are atomic) Intuitively, for any x, y D C such that x P y, cardinality(x) < cardinality(y) 4 / 22

5 An ambiguity theory of the plurality-cardinality link These patterns may be explained in part by an ambiguity in the morphosyntax of more, such that it spells out much plus -er with mass nouns, but many plus -er with plural nouns. (6) a. more 1 coffee much-er coffee b. more 2 coffees many-er coffee-pl Correspondingly, much contributes a variable over measure functions in general (with constraints), while many specifically contributes a cardinality function. (7) a. much = λd.λr η. µ quantity (r) d type η stands for e or v b. many = λd.λr η. µ cardinality (r) d 5 / 22

6 Some problems for the ambiguity theory One immediate issue with the ambiguity theory is that many never surfaces in the verbal domain, yet the cardinality-semantic plurality link still obtains for event comparison (8) a. too much coffee b. too many coffees (9) a. run on the track too much b. run to the track too much Similarly, the interpretation of object mass nouns is an issue, since they too do not surface with many but allow comparison by cardinality (10) too much traffic 6 / 22

7 Some problems for the ambiguity theory Another issue is that an adequate analysis of more 1 (i.e., much-er) must capture the fact that such comparatives display variable dimensionality both across and within predicates. (11) Variability across predicates a. more 1 coffee volume, *temperature b. more 1 global warming temperature, *volume (12) Variability within predicates a. more 1 coffee volume, weight b. run more 1 distance, duration 7 / 22

8 Little cross-linguistic support for the ambiguity theory If the distinction between primitive much and many was semantic, we would expect it to appear more robustly cross-linguistically, but this is not the case (13) Spanish (from Wellwood forthcoming) a. mucha cerveza volume b. muchas cervezas number (14) Bulgarian a. mnogo bira volume b. mnogo biri number 8 / 22

9 Little cross-linguistic support for the ambiguity theory Typologically more broadly, any way that a language has of indicating plurality marks a shift in interpretation from volume to number language volume number difference English much soup many cookies lexical Spanish mucha sopa muchas galletas agreement Italian molta minestra molti biscotti agreement French beaucoup de soupe beaucoup de biscuits morphology Macedonian mnogu supa mnogu kolaci morphology Mandarin henduo tang henduo kuai quqi classifier Bangla onek sup onek-gulo biskut classifier Table 1: Where many signals number with plural Ns in English, other languages combine a univocal form with (broadly) plural marking. (Wellwood 2014) 9 / 22

10 An alternative theory Wellwood 2014, 2015, forthcoming, building primarily on Schwarzschild 2002, 2006 and Bale & Barner 2009, argues for an alternative, univocal account, in which the patterns of constrained variability are captured by a new, stronger condition on the selection of measure functions. string morphosyntax semantics ambiguity more N much µ -er n... σ(µ)(x)... more Ns many-er n-pl... cardinality(xx)... univocality more N much µ -er n... σ(µ)(x)... more Ns much µ -er n-pl... σ(µ)(xx)... Table 2: Differences in the alignment between strings, morphosyntax, and semantics on the two accounts. By xx, yy, etc. in Table 2 and below, only visual clarity of talk of pluralities is intended - their nature isn t at issue. 10 / 22

11 An alternative theory Wellwood s proposal: the Number generalization is a special case of the Monotonicity generalization, and arises due to the semantics of much. The solution has two pieces: Surfacing many: many spells out much in the context of a nominal plural. Restricting much: permissible µs that much encodes are invariant under structure-preserving permutation. Claim: only number meets this and S-monotonicity for coffees and furniture. 11 / 22

12 An alternative theory What unifies plurals and object mass nouns, such that they require number comparisons in the comparative? Perhaps simply: their (ordered) domains have atomic minimal parts (Bale & Barner 2009). abc ab ac bc a b c Figure 1: Hypothetical extension for furniture and coffees in a context. Nodes represent pieces of furniture / containers of coffee and pluralities thereof, lines represent plural-part relations. 12 / 22

13 An alternative theory The intuition: cardinality is the only permissible measure of such domains, because it uniquely characterizes these domains. That is, measures by cardinality assign all of the atomic minimal parts to 1, the 2-atom pluralities to 2, etc. A function like weight, in contrast, can assign different values to each atom, each 2-atom plurality, etc. Only a mapping by cardinality represents the structure of an atomic join semi-lattice. (Wellwood forthcoming) 13 / 22

14 An alternative theory A new constraint, augmenting S-monotonicity, which says that permissible σ assignments to µ must be A(utomorphism)-invariant i.e., they assign the same value to all x in P as to x s image under any structure-preserving permutation. A-invariance x D P, h Aut( D P, P ), µ(x) = µ(h(x)) (15) much µ σ (d)(x) = σ(µ)(x) d (Wellwood forthcoming) 14 / 22

15 An alternative theory Automorphism: a bijective function that maps a set, say D P, to itself, and meets the condition in (16). In effect, an automorphism maps elements of an ordered set to those same elements, such that all of the same ordering relations are preserved. (16) x, y D P, x P y iff h(x) P h(y) (Wellwood forthcoming) 15 / 22

16 An alternative theory An illustration: Let D P = {a, b, c, ab, ac, bc, abc} (the inclusive set of pluralities whose minimal parts are the individuals a, b, and c), and the ordering P on this set has all of the properties that we think the domains of plural nouns like toys or superordinate mass nouns like furniture have (i.e., they are atomic join semi-lattices). Then, h in (17) is an example of an automorphism on D P. (17) Automorphism h in Aut( D P, P ) a. h = [a b, b c, c a, ab bc, ac ab, bc ac, abc abc] b. range(h) = domain(h) [endomorphy] c. there is a function g such that domain(g) = range(h) [bijectivity] d. x, y[x P y h(x) P h(y)] [order preservation] (Wellwood forthcoming) 16 / 22

17 An alternative theory An illustration: Let D P = {a, b, c, ab, ac, bc, abc} (the inclusive set of pluralities whose minimal parts are the individuals a, b, and c), and the mereological ordering P on this set. There are many functions h that are not automorphisms on D P ; (18) gives some examples, along with reasons for their failure. (18) Functions h not in Aut( D P, P ) a. Any h = [a d,... ], since d D P [not endomorphic] b. Any h = [a b, c b,... ], since not invertible [not bijective] c. Any h = [a c, ab a,... ], since a P ab, but h(a) P h(ab) [not order-preserving] (Wellwood forthcoming) 17 / 22

18 An alternative theory Distinguishing cardinality and weight measures Since any automorphism h on atomic D P, P pairs singletons with singletons, doubletons with doubletons, etc., then any plurality xx D P is such that cardinality(xx) = cardinality(h(xx)). Thus, measures by cardinality are A-invariant with respect to such a domain. However, measures by weight are not; a counter-example is given in (19). (19) Let D P = {b, c, bc}, h an automorphism on D P such that h(b) = c, and weight : [b 120lbs, c 240lbs,...]. Then, since a. weight(h(b)) = weight(c), b. weight(h(b)) = 240lbs; therefore, c. weight(h(b)) weight(b), because 120lbs 240lbs. 18 / 22

19 An alternative theory Can A-invarience supplant S-monotonicity? It seems that the answer is no. There are measure functions that fail to preserve the structure of the domain for measurement, but which would satisfy A-invariance. Consider a hypothetical such function, one, that maps everything to the number 1. This function trivially satisfies A-invariance, since any x D P will be such that one(x) = 1, and of course one(h(x)) = 1, etc. Such a function will not satisfy S-monotonicity, however, since any case of some x, y D P such that x P y, it is not the case that one(x) one(y). 19 / 22

20 An alternative theory Does A-invarience apply in the case of measurement of mass nouns? It seems that the answer is yes. Suppose that the extension of coffee is a dense ordering of portions of coffee by inclusion. Any automorphism (hence, any h Aut( D C, C )) will preserve this structure exactly. It seems that just in the same way that cardinality can be said to represent essential structure of plural part-of relations, volume or weight do the same for material part-of relations. 20 / 22

21 References I Acquaviva, Paolo Lexical plurals: A morphosemantic approach Oxford studies in theoretical linguistics. Oxford, UK: Oxford University Press. Bale, Alan & David Barner The interpretation of functional heads: Using comparatives to explore the mass/count distinction. Journal of Semantics 26(3) Hackl, Martin Comparative quantifiers and plural predication. In K. Megerdoomian & Leora Anne Bar-el (eds.), Proceedings of WCCFL XX, Somerville, Massachusetts: Cascadilla Press. Schwarzschild, Roger The grammar of measurement. In B. Jackson (ed.), Proceedings of SALT XII, Cornell University, Ithaca, NY: CLC Publications. Schwarzschild, Roger The role of dimensions in the syntax of noun phrases. Syntax 9(1) Schwarzschild, Roger Neoneoneo Davidsonian Analysis of Nouns. Handout for the 2nd Mid-Atlantic Colloquium for Studies in Meaning, University of Maryland. 21 / 22

22 References II Solt, Stephanie Q-adjectives and the semantics of quantity. Journal of Semantics 32( ). Wellwood, Alexis Measuring predicates: University of Maryland, College Park dissertation. Wellwood, Alexis On the semantics of comparison across categories. Linguistics and Philosophy 38(1) Wellwood, Alexis. forthcoming. The semantics of more Studies in Semantics and Pragmatics. Oxford UK: Oxford University Press. Wellwood, Alexis, Valentine Hacquard & Roumyana Pancheva Measuring and comparing individuals and events. Journal of Semantics 29(2) / 22

a. Rachel is {taller / more intelligent} than Stephanie (is). a. Rachel is the {tallest / most intelligent} (student in my class).

a. Rachel is {taller / more intelligent} than Stephanie (is). a. Rachel is the {tallest / most intelligent} (student in my class). Degree semantics1 1 Gradability Certain predicates allow us to specify to what extent the predicate holds; we call them gradable. There are many constructions which only apply to gradable predicates. (1)

More information

Countability in the Nominal and Verbal Domains

Countability in the Nominal and Verbal Domains Countability in the Nominal and Verbal Domains August 17, 2016 ESSLLI 2016, Bolzano Advanced Course Hana Filip & Peter Sutton hana.filip@gmail.com peter.r.sutton@icloud.com Department of Linguistics Heinrich-Heine-University

More information

Comparative superlatives in relative clauses

Comparative superlatives in relative clauses SynSem, Fall 2017 Comparative superlatives in relative clauses Nico(letta) Loccioni 1 Introduction Languages like Italian and Spanish extensively use relativization as a strategy to form relative interpretations

More information

Comparison Across Domains in Delineation Semantics

Comparison Across Domains in Delineation Semantics Noname manuscript No. (will be inserted by the editor) Comparison Across Domains in Delineation Semantics Heather Burnett Received: date / Accepted: date Abstract This paper presents a new logical analysis

More information

Hardegree, Formal Semantics, Handout of 8

Hardegree, Formal Semantics, Handout of 8 Hardegree, Formal Semantics, Handout 2015-03-24 1 of 8 1. Number-Words By a number-word or numeral 1 we mean a word (or word-like compound 2 ) that denotes a number. 3 In English, number-words appear to

More information

An Alternative Semantics for English Aspectual Particles

An Alternative Semantics for English Aspectual Particles Aspectual Particles 1 of 27 An Alternative Semantics for English Aspectual Particles Alexander Klapheke Harvard University SNEWS November 15, 2014 Aspectual Particles Overview 2 of 27 Overview Previous

More information

Frege: Logical objects by abstraction and their criteria of identity. Matthias Schirn (University of Munich, Munich Center of Mathematical Philosophy)

Frege: Logical objects by abstraction and their criteria of identity. Matthias Schirn (University of Munich, Munich Center of Mathematical Philosophy) 1 Frege: Logical objects by abstraction and their criteria of identity Matthias Schirn (University of Munich, Munich Center of Mathematical Philosophy) Abstraction à la Frege A schema for a Fregean abstraction

More information

CLASSICAL EXTENSIONAL MEREOLOGY. Mereology

CLASSICAL EXTENSIONAL MEREOLOGY. Mereology 1 Mereology Core axioms and concepts parthood sum Higher order properties: cumulativity divisivity (aka divisiveness) atomicity 2 Mereology is the theory of parthood derived from the Greek µέρος (meros)

More information

Bringing machine learning & compositional semantics together: central concepts

Bringing machine learning & compositional semantics together: central concepts Bringing machine learning & compositional semantics together: central concepts https://githubcom/cgpotts/annualreview-complearning Chris Potts Stanford Linguistics CS 244U: Natural language understanding

More information

Focus in complex noun phrases

Focus 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 information

Homogeneity and Plurals: From the Strongest Meaning Hypothesis to Supervaluations

Homogeneity 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 information

The Lambek-Grishin calculus for unary connectives

The Lambek-Grishin calculus for unary connectives The Lambek-Grishin calculus for unary connectives Anna Chernilovskaya Utrecht Institute of Linguistics OTS, Utrecht University, the Netherlands anna.chernilovskaya@let.uu.nl Introduction In traditional

More information

Semantics and Generative Grammar. The Semantics of Adjectival Modification 1. (1) Our Current Assumptions Regarding Adjectives and Common Ns

Semantics 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 information

Introduction to Semantics. The Formalization of Meaning 1

Introduction 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 information

Comparative-induced event measure relations

Comparative-induced event measure relations Comparative-induced event measure relations James Kirby University of Chicago 10 Jan 2009 In Vietnamese quantity comparison structures, differentials are prohibited from appearing phraseinternally. I argue

More information

Proseminar on Semantic Theory Fall 2010 Ling 720. Remko Scha (1981/1984): Distributive, Collective and Cumulative Quantification

Proseminar 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 information

Tense and Mood in conditional sentences. Katrin Schulz ILLC/University of Amsterdam

Tense and Mood in conditional sentences. Katrin Schulz ILLC/University of Amsterdam Tense and Mood in conditional sentences Katrin Schulz ILLC/University of Amsterdam K.Schulz@uva.nl 1 1. Introduction 2 1. Introduction Aim of the research: 3 1. Introduction Aim of the research: A compositional

More information

Reflexives and non-fregean quantifiers

Reflexives and non-fregean quantifiers UCLA Working Papers in Linguistics, Theories of Everything Volume 17, Article 49: 439-445, 2012 Reflexives and non-fregean quantifiers Richard Zuber It is shown that depending on the subject noun phrase

More information

Cognitive foundations of measuring and counting and their reflection in determiner systems

Cognitive foundations of measuring and counting and their reflection in determiner systems Cognitive foundations of measuring and counting and their reflection in determiner systems Mass and Count in Romance and Germanic Languages December 16-17, 2013 Universität Zürich Manfred Krifka krifka@rz.hu-berlin.de

More information

The 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. 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 information

Chiastic Lambda-Calculi

Chiastic Lambda-Calculi Chiastic Lambda-Calculi wren ng thornton Cognitive Science & Computational Linguistics Indiana University, Bloomington NLCS, 28 June 2013 wren ng thornton (Indiana University) Chiastic Lambda-Calculi NLCS,

More information

Semantics and Generative Grammar. A Little Bit on Adverbs and Events

Semantics 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 information

Towards an Algebraic Morphosyntax

Towards an Algebraic Morphosyntax Towards an Algebraic Morphosyntax Thomas Graf mail@thomasgraf.net http://thomasgraf.net Stony Brook University Moscow State University December 16, 2015 Piece of a Larger Puzzle There is a huge number

More information

Generalized Quantifiers Logical and Linguistic Aspects

Generalized 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 information

SEMANTICS OF POSSESSIVE DETERMINERS STANLEY PETERS DAG WESTERSTÅHL

SEMANTICS OF POSSESSIVE DETERMINERS STANLEY PETERS DAG WESTERSTÅHL SEMANTICS OF POSSESSIVE DETERMINERS STANLEY PETERS DAG WESTERSTÅHL Linguistics Department, Stanford University Department of Philosophy, Göteborg University peters csli.stanford.edu, dag.westerstahl phil.gu.se

More information

CS632 Notes on Relational Query Languages I

CS632 Notes on Relational Query Languages I CS632 Notes on Relational Query Languages I A. Demers 6 Feb 2003 1 Introduction Here we define relations, and introduce our notational conventions, which are taken almost directly from [AD93]. We begin

More information

Context Free Grammars

Context Free Grammars Automata and Formal Languages Context Free Grammars Sipser pages 101-111 Lecture 11 Tim Sheard 1 Formal Languages 1. Context free languages provide a convenient notation for recursive description of languages.

More information

Scalar additives and their interaction with focus

Scalar additives and their interaction with focus 2 Restrictions on the position of focus 1 Introduction Scalar additives and their interaction with focus Maziar Toosarvandani University of California, Berkeley California Universities Semantics and Pragmatics

More information

A* Search. 1 Dijkstra Shortest Path

A* Search. 1 Dijkstra Shortest Path A* Search Consider the eight puzzle. There are eight tiles numbered 1 through 8 on a 3 by three grid with nine locations so that one location is left empty. We can move by sliding a tile adjacent to the

More information

A unified account of distributive NPs, for-adverbials, and measure constructions

A unified account of distributive NPs, for-adverbials, and measure constructions A unified account of distributive NPs, for-adverbials, and measure constructions Lucas Champollion University of Pennsylvania / Palo Alto Research Center Sinn und Bedeutung 14 September 29, 2009 Lucas

More information

Introduction to Kleene Algebras

Introduction to Kleene Algebras Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)

More information

2 A not-quite-argument for X-bar structure in noun phrases

2 A not-quite-argument for X-bar structure in noun phrases CAS LX 321 / GRS LX 621 Syntax: Introduction to Sentential Structure ovember 16, 2017 1 and pronouns (1) he linguists yodel. (2) We linguists yodel. (3) hey looked at us linguists. (4) hey looked at linguists.

More information

Spring 2012 Ling 753 A Review of Some Key Ideas in the Semantics of Plurals. 1. Introduction: The Interpretations of Sentences Containing Plurals

Spring 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 information

Propositional Logic. Spring Propositional Logic Spring / 32

Propositional Logic. Spring Propositional Logic Spring / 32 Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements

More information

Relational Reasoning in Natural Language

Relational Reasoning in Natural Language 1/67 Relational Reasoning in Natural Language Larry Moss ESSLLI 10 Course on Logics for Natural Language Inference August, 2010 Adding transitive verbs the work on R, R, and other systems is joint with

More information

CS 2800: Logic and Computation Fall 2010 (Lecture 13)

CS 2800: Logic and Computation Fall 2010 (Lecture 13) CS 2800: Logic and Computation Fall 2010 (Lecture 13) 13 October 2010 1 An Introduction to First-order Logic In Propositional(Boolean) Logic, we used large portions of mathematical language, namely those

More information

Generality, Extensibility, and Paradox

Generality, Extensibility, and Paradox Generality, Extensibility, and Paradox James Studd Oxford Aristotelian Society 28th November 2016 Outline I. Absolute generality an introduction II. The Dummettian argument a coherent case for relativism?

More information

Person Case Constraints and Feature Complexity in Syntax

Person Case Constraints and Feature Complexity in Syntax Person Case Constraints and Feature Complexity in Syntax Thomas Graf mail@thomasgraf.net http://thomasgraf.net Stony Brook University University of Vienna January 9, 2014 What is the PCC? Person Case Constraint

More information

ON THE LOGIC OF VERBAL MODIFICATION DAVID BEAVER AND CLEO CONDORAVDI

ON THE LOGIC OF VERBAL MODIFICATION DAVID BEAVER AND CLEO CONDORAVDI ON THE LOGIC OF VERBAL ODIFICATION DAVID BEAVER AND CLEO CONDORAVDI Department of Linguistics University of Texas at Austin dib@mail.utexas.edu PARC and Department of Linguistics Stanford University condorav@csli.stanford.edu

More information

Additive adjectives as nonstandard comparatives

Additive adjectives as nonstandard comparatives Additive adjectives as nonstandard comparatives Cara Feldscher SWA 2017 Additive adjectives:, extra, another... Goal: To show that additive adjectives can be analyzed as comparatives. Roadmap: 1. Ambiguity

More information

Syllogistic Logic and its Extensions

Syllogistic Logic and its Extensions 1/31 Syllogistic Logic and its Extensions Larry Moss, Indiana University NASSLLI 2014 2/31 Logic and Language: Traditional Syllogisms All men are mortal. Socrates is a man. Socrates is mortal. Some men

More information

Classical Propositional Logic

Classical Propositional Logic The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,

More information

Spring 2017 Ling 620. The Semantics of Modals, Part 2: The Modal Base 1

Spring 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 information

Parasitic Scope (Barker 2007) Semantics Seminar 11/10/08

Parasitic 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 information

Realism and Idealism External Realism

Realism and Idealism External Realism Realism and Idealism External Realism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 8/10/15 What is metaphysics? Metaphysics is the attempt to: give a general description of the whole of

More information

Logic: The Big Picture

Logic: The Big Picture Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving

More information

Axiomatic set theory. Chapter Why axiomatic set theory?

Axiomatic set theory. Chapter Why axiomatic set theory? Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its

More information

Deriving Distributivity from Discourse. Grant Xiaoguang Li Marlboro College

Deriving Distributivity from Discourse. Grant Xiaoguang Li Marlboro College Deriving Distributivity from Discourse Grant Xiaoguang Li Marlboro College This paper discusses the structure that incorporates information from discourse to derive distributivity. Following a proposal

More information

Peter Hallman, University of Vienna

Peter Hallman, University of Vienna All and Every as Quantity Superlatives Peter Hallman, University of Vienna peter.hallman@univie.ac.at Summary An analysis is proposed that captures similarities between most and all in English bytreatingall

More information

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of

More information

VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents

VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught

More information

Quantifier Scope Constraints in ACD: Implications for the Syntax of Relative Clauses

Quantifier Scope Constraints in ACD: Implications for the Syntax of Relative Clauses Quantifier Scope Constraints in AC: Implications for the Syntax of Relative Clauses Jorie Koster-Moeller and Martin Hackl Pomona College 1. Overview It is widely assumed that restrictive relative clauses

More information

Predicate Logic. x. x + 0 = x. Predicate logic over integer expressions: a language of logical assertions, for example. Why discuss predicate logic?

Predicate Logic. x. x + 0 = x. Predicate logic over integer expressions: a language of logical assertions, for example. Why discuss predicate logic? Predicate Logic Predicate logic over integer expressions: a language of logical assertions, for example x. x + 0 = x Why discuss predicate logic? It is an example of a simple language It has simple denotational

More information

Spring 2018 Ling 620 The Basics of Intensional Semantics, Part 1: The Motivation for Intensions and How to Formalize Them 1

Spring 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 information

This is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability

This is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability 16.2. MINIMAL ARITHMETIC AND REPRESENTABILITY 207 If T is a consistent theory in the language of arithmetic, we say a set S is defined in T by D(x) if for all n, if n is in S, then D(n) is a theorem of

More information

The Formal Architecture of. Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple

The Formal Architecture of. Lexical-Functional Grammar. Ronald M. Kaplan and Mary Dalrymple The Formal Architecture of Lexical-Functional Grammar Ronald M. Kaplan and Mary Dalrymple Xerox Palo Alto Research Center 1. Kaplan and Dalrymple, ESSLLI 1995, Barcelona Architectural Issues Representation:

More information

Antonymy and Evaluativity

Antonymy and Evaluativity Antonymy and Evaluativity SEMANTICS AND LINGUISTIC THEORY 17 MAY 11, 2007 Jessica Rett hughesj@rutgers.edu A construction is evaluative if it makes reference to a degree that exceeds a contextuallyvalued

More information

Propositional Logic: Syntax

Propositional Logic: Syntax Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic

More information

Compositionality and Syntactic Structure Marcus Kracht Department of Linguistics UCLA 3125 Campbell Hall 405 Hilgard Avenue Los Angeles, CA 90095

Compositionality and Syntactic Structure Marcus Kracht Department of Linguistics UCLA 3125 Campbell Hall 405 Hilgard Avenue Los Angeles, CA 90095 Compositionality and Syntactic Structure Marcus Kracht Department of Linguistics UCLA 3125 Campbell Hall 405 Hilgard Avenue Los Angeles, CA 90095 1543 kracht@humnet.ucla.edu 1. The Questions ➀ Why does

More information

XII. Elementary Function

XII. Elementary Function XII. Elementary Function Yuxi Fu BASICS, Shanghai Jiao Tong University What is the class of arithmetic functions we use in mathematics? Computability Theory, by Y. Fu XII. Elementary Function 1 / 17 Definition

More information

CKY & Earley Parsing. Ling 571 Deep Processing Techniques for NLP January 13, 2016

CKY & Earley Parsing. Ling 571 Deep Processing Techniques for NLP January 13, 2016 CKY & Earley Parsing Ling 571 Deep Processing Techniques for NLP January 13, 2016 No Class Monday: Martin Luther King Jr. Day CKY Parsing: Finish the parse Recognizer à Parser Roadmap Earley parsing Motivation:

More information

Models of Adjunction in Minimalist Grammars

Models of Adjunction in Minimalist Grammars Models of Adjunction in Minimalist Grammars Thomas Graf mail@thomasgraf.net http://thomasgraf.net Stony Brook University FG 2014 August 17, 2014 The Theory-Neutral CliffsNotes Insights Several properties

More information

From Constructibility and Absoluteness to Computability and Domain Independence

From Constructibility and Absoluteness to Computability and Domain Independence From Constructibility and Absoluteness to Computability and Domain Independence Arnon Avron School of Computer Science Tel Aviv University, Tel Aviv 69978, Israel aa@math.tau.ac.il Abstract. Gödel s main

More information

Advanced Undecidability Proofs

Advanced Undecidability Proofs 17 Advanced Undecidability Proofs In this chapter, we will discuss Rice s Theorem in Section 17.1, and the computational history method in Section 17.3. As discussed in Chapter 16, these are two additional

More information

Model-Theory of Property Grammars with Features

Model-Theory of Property Grammars with Features Model-Theory of Property Grammars with Features Denys Duchier Thi-Bich-Hanh Dao firstname.lastname@univ-orleans.fr Yannick Parmentier Abstract In this paper, we present a model-theoretic description of

More information

Relations to first order logic

Relations to first order logic An Introduction to Description Logic IV Relations to first order logic Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014 Marco

More information

S NP VP 0.9 S VP 0.1 VP V NP 0.5 VP V 0.1 VP V PP 0.1 NP NP NP 0.1 NP NP PP 0.2 NP N 0.7 PP P NP 1.0 VP NP PP 1.0. N people 0.

S NP VP 0.9 S VP 0.1 VP V NP 0.5 VP V 0.1 VP V PP 0.1 NP NP NP 0.1 NP NP PP 0.2 NP N 0.7 PP P NP 1.0 VP  NP PP 1.0. N people 0. /6/7 CS 6/CS: Natural Language Processing Instructor: Prof. Lu Wang College of Computer and Information Science Northeastern University Webpage: www.ccs.neu.edu/home/luwang The grammar: Binary, no epsilons,.9..5

More information

CS1800: Strong Induction. Professor Kevin Gold

CS1800: Strong Induction. Professor Kevin Gold CS1800: Strong Induction Professor Kevin Gold Mini-Primer/Refresher on Unrelated Topic: Limits This is meant to be a problem about reasoning about quantifiers, with a little practice of other skills, too

More information

Gradable Adjectives, Compounded Scales, Conjunction and Structured Meanings

Gradable Adjectives, Compounded Scales, Conjunction and Structured Meanings Gradable Adjectives, Compounded Scales, Conjunction and Structured Meanings Alan Bale (alanbale@mit.edu) Winter, 2007 1 Introduction General Issues: 1. What are the semantic properties correlated with

More information

X-bar theory. X-bar :

X-bar theory. X-bar : is one of the greatest contributions of generative school in the filed of knowledge system. Besides linguistics, computer science is greatly indebted to Chomsky to have propounded the theory of x-bar.

More information

Semantics 2 Part 1: Relative Clauses and Variables

Semantics 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 information

Universal Algebra for Logics

Universal Algebra for Logics Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic

More information

Introduction to Semantics. Common Nouns and Adjectives in Predicate Position 1

Introduction 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 information

Tree Adjoining Grammars

Tree Adjoining Grammars Tree Adjoining Grammars Feature Structure Based TAG Laura Kallmeyer & Benjamin Burkhardt HHU Düsseldorf WS 2017/2018 1 / 20 Outline 1 Why feature structures? 2 Basics of feature structure logic 3 Feature

More information

Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only

Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only 1/53 Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only Larry Moss Indiana University Nordic Logic School August 7-11, 2017 2/53 An example that we ll see a few times Consider the

More information

A Time-relational Approach to Aspect in Mandarin Chinese and English

A Time-relational Approach to Aspect in Mandarin Chinese and English A Time-relational Approach to Aspect in Mandarin Chinese and English Mingya Liu University of Tübingen mingya.liu@uni-tuebingen.de July 22, 2008 Mingya Liu (Tübingen) Aspect in Chinese and English July

More information

Pragmatics of Location

Pragmatics of Location Pragmatics of Location Prerna Nadathur May 31, 2010 It has frequently been observed that meteorological predicates such as rain are regularly associated with locations. The standard explanation holds that

More information

Seminar in Semantics: Gradation & Modality Winter 2014

Seminar in Semantics: Gradation & Modality Winter 2014 1 Subject matter Seminar in Semantics: Gradation & Modality Winter 2014 Dan Lassiter 1/8/14 Handout: Basic Modal Logic and Kratzer (1977) [M]odality is the linguistic phenomenon whereby grammar allows

More information

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula: Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and

More information

Syntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.

Syntax. 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 information

Philosophy 240: Symbolic Logic

Philosophy 240: Symbolic Logic Philosophy 240: Symbolic Logic Russell Marcus Hamilton College Fall 2014 Class #41 - Second-Order Quantification Marcus, Symbolic Logic, Slide 1 Second-Order Inferences P Consider a red apple and a red

More information

A DOP Model for LFG. Rens Bod and Ronald Kaplan. Kathrin Spreyer Data-Oriented Parsing, 14 June 2005

A DOP Model for LFG. Rens Bod and Ronald Kaplan. Kathrin Spreyer Data-Oriented Parsing, 14 June 2005 A DOP Model for LFG Rens Bod and Ronald Kaplan Kathrin Spreyer Data-Oriented Parsing, 14 June 2005 Lexical-Functional Grammar (LFG) Levels of linguistic knowledge represented formally differently (non-monostratal):

More information

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

Proseminar 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 information

The Logic of Partitions with an application to Information Theory

The Logic of Partitions with an application to Information Theory 1 The Logic of Partitions with an application to Information Theory David Ellerman University of California at Riverside and WWW.Ellerman.org 2 Outline of Talk Logic of partitions dual to ordinary logic

More information

Internal and Interval Semantics for CP-Comparatives

Internal and Interval Semantics for CP-Comparatives Internal and Interval Semantics for CP-Comparatives Fred Landman Linguistics Department, Tel Aviv University, landman@post.tau.ac.il Abstract. The interval degree semantics for clausal (CP)-comparatives

More information

Proseminar 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

Proseminar 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 information

Regular and synchronizing transformation monoids

Regular and synchronizing transformation monoids Regular and synchronizing transformation monoids Peter J. Cameron NBSAN, York 23 November 2011 Mathematics may be defined as the subject in which we never know what we are talking about, nor whether what

More information

Adding Negation-as-Failure to Intuitionistic Logic Programming

Adding Negation-as-Failure to Intuitionistic Logic Programming Adding Negation-as-Failure to Intuitionistic Logic Programming Anthony J. Bonner L. Thorne McCarty Rutgers University Department of Computer Science New Brunswick, NJ 08903 bonner@paul.rutgers.edu mccarty@cs.rutgers.edu

More information

This kind of reordering is beyond the power of finite transducers, but a synchronous CFG can do this.

This kind of reordering is beyond the power of finite transducers, but a synchronous CFG can do this. Chapter 12 Synchronous CFGs Synchronous context-free grammars are a generalization of CFGs that generate pairs of related strings instead of single strings. They are useful in many situations where one

More information

ITERATING ALONG A PRIKRY SEQUENCE

ITERATING ALONG A PRIKRY SEQUENCE ITERATING ALONG A PRIKRY SEQUENCE SPENCER UNGER Abstract. In this paper we introduce a new method which combines Prikry forcing with an iteration between the Prikry points. Using our method we prove from

More information

Introduction to lambda calculus Part 2

Introduction to lambda calculus Part 2 Introduction to lambda calculus Part 2 Antti-Juhani Kaijanaho 2017-01-24... 1 Untyped lambda calculus 1.1 Syntax... x, y, z Var t, u Term t, u ::= x t u λx t... In this document, I will be using the following

More information

DIAGRAMMATIC SYNTAX AND ITS CONSTRAINTS. 1. Introduction: Applications and Foundations

DIAGRAMMATIC SYNTAX AND ITS CONSTRAINTS. 1. Introduction: Applications and Foundations DIAGRAMMATIC SYNTAX AND ITS CONSTRAINTS ANDREI RODIN 1. Introduction: Applications and Foundations In their recent papers Zynovy Duskin and his co-authors stress the following problem concerning diagrammatic

More information

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Why Learning Logic? Logic. Propositional Logic. Compound Propositions Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional

More information

Computational Models - Lecture 4

Computational Models - Lecture 4 Computational Models - Lecture 4 Regular languages: The Myhill-Nerode Theorem Context-free Grammars Chomsky Normal Form Pumping Lemma for context free languages Non context-free languages: Examples Push

More information

Surface Reasoning Lecture 2: Logic and Grammar

Surface Reasoning Lecture 2: Logic and Grammar Surface Reasoning Lecture 2: Logic and Grammar Thomas Icard June 18-22, 2012 Thomas Icard: Surface Reasoning, Lecture 2: Logic and Grammar 1 Categorial Grammar Combinatory Categorial Grammar Lambek Calculus

More information

Computational Models - Lecture 4 1

Computational Models - Lecture 4 1 Computational Models - Lecture 4 1 Handout Mode Iftach Haitner and Yishay Mansour. Tel Aviv University. April 3/8, 2013 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice

More information

Lecturecise 22 Weak monadic second-order theory of one successor (WS1S)

Lecturecise 22 Weak monadic second-order theory of one successor (WS1S) Lecturecise 22 Weak monadic second-order theory of one successor (WS1S) 2013 Reachability in the Heap Many programs manipulate linked data structures (lists, trees). To express many important properties

More information

N.Sathyaseelan, Dr.E.Chandrasekaran

N.Sathyaseelan, Dr.E.Chandrasekaran SELF WEAK COMPLEMENTARY FUZZY GRAPHS N.Sathyaseelan, Dr.E.Chandrasekaran (Assistant Professor in Mathematics, T.K Government Arts College, Vriddhachalam 606 001.) (Associate Professor in Mathematics, Presidency

More information

Lecture 24: Approximate Counting

Lecture 24: Approximate Counting CS 710: Complexity Theory 12/1/2011 Lecture 24: Approximate Counting Instructor: Dieter van Melkebeek Scribe: David Guild and Gautam Prakriya Last time we introduced counting problems and defined the class

More information

Parsing. Based on presentations from Chris Manning s course on Statistical Parsing (Stanford)

Parsing. Based on presentations from Chris Manning s course on Statistical Parsing (Stanford) Parsing Based on presentations from Chris Manning s course on Statistical Parsing (Stanford) S N VP V NP D N John hit the ball Levels of analysis Level Morphology/Lexical POS (morpho-synactic), WSD Elements

More information