DOCSLIB.ORG

Comparative Quantifiers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Comparative Quantifiers Comparative Quantifiers by Martin Hackl " M.A. Linguistics and Philosophy University of Vienna, Austria 1995 Submitted to the Department of Linguistics and Philosophy in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Linguistics at the Massachusetts Institute of Technology February 2001 © 2000 Martin Hackl. All rights reserved. The author hereby grants to MIT permission to reproduce and to distribute publicly paper and electronic copies of this thesis document in whole or in part. #$%&'()*+",-".)(/,*0"1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 " Department of Linguistics and Philosophy October 23rd 2000 2+*($-$+3"450"11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 " Irene Heim Professor of Linguistics Thesis Supervisor .66+7(+3"450" 111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 " Alec Marantz Professor of Linguistics Head of the Department of Linguistics and Philosophy !" Comparative Quantifiers 45" 9'*($&":'6;<" Submitted to the Department of Linguistics and Philosophy at MIT on October 23rd in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Linguistics Abstract =/+">'$&"%,'<",-"(/+"(/+?$?"$?"(,"7*+?+&("'"&,@+<"'&'<5?$?",-"6,>7'*'($@+"A)'&($-$+*?" ?)6/" '?" more than three students."=/+"7*+@'<+&("@$+B",&"?)6/"+C7*+??$,&?" '3@,6'(+3" $&" D+&+*'<$E+3" F)'&($-$+*" =/+,*5" $?" (/'(" (/+5" 3+&,(+3" %+&+*'<$E+3" A)'&($-$+*?" *'&%$&%" ,@+*" $&3$@$3)'<?" G" +&($*+<5" ,&" '" 7'*" B$(/" +C7*+??$,&?" <$;+" every student, some student(s), +(61" .66,*3$&%" (," (/$?" @$+BH" more than three $?" '" 3+(+*>$&+* I<$;+" everyJ" (/'(" $?H" +@+&" (/,)%/" >,*7/,K?5&('6($6'<<5" 6,>7<+CH" ?+>'&($6'<<5" '" ?$>7<+C" +C7*+??$,&" (/'(" 6'&" G" $&" (+*>?" ,-" $(?" $&(+*'6($,&?" B$(/" (/+" ?5&('6($6" +&@$*,&>+&(" $(" '77+'*?" $&" G" 4+" @$+B+3" '?" 3+&,($&%" ?$>7<5" '" *+<'($,&" 4+(B++&"?+(?",-"$&3$@$3)'<?1"" =/+"7*,7,?'<"(/'("B$<<"4+"3+@+<,7+3"$&"(/$?"(/+?$?">'$&('$&?",&"(/+",(/+*"/'&3"(/'(" +C7*+??$,&?"<$;+"more than three '*+"'<?,"?+>'&($6'<<5"6,>7<+C1"9,*+"?7+6$-$6'<<5H" '&"'&'<5?$?",-"6,>7'*'($@+"A)'&($-$+*?"B$<<"4+"%$@+&"(/'("$?"-)<<5"6,>7,?$($,&'<"3,B&" (," <+@+<" ,-" (/+" -,*>'($,&" ,-" 6,>7'*'($@+" 3+(+*>$&+*?1" =/+" 7*,7,?'<" $?" 4'?+3" ,&" 6,&6+7(?" (/'(" '*+" $&3+7+&3+&(<5" &++3+3" (," '&'<5E+" 6,>7'*'($@+" 6,&?(*)6($,&?1" =/*++" >'$&" 7$+6+?" B$<<" 4+" '*%)+3" (," -,*>" (/+" ?+>'&($6" '&3" ?5&('6($6" 6,*+" ,-" 6,>7'*'($@+" A)'&($-$+*?0" '" 3+%*++" -)&6($,&" +C7*+??+3" 45" MANYH" '" 3+%*++" 3+?6*$7($,&" %$@+&" 45" (/+" &)>+*'<" '&3" (/+" 6,>7'*'($@+" *+<'($,&" +C7*+??+3" 45" (/+" 6,>7'*'($@+">,*7/+>+"–er1"L>7,*('&(<5H"+'6/",-"(/+"(/*++"7$+6+?"6'&"4+"+>7$*$6'<<5" ?/,B&" (," $&(+*'6(" $&" 7*+3$6('4<5" '&3" I7'*($'<<5J" $&3+7+&3+&(" B'5?" B$(/" +<+>+&(?" $&?$3+"(/+"A)'&($-$+*"'?"B+<<"'?"B$(/"+<+>+&(?"$&"(/+">'(*$C"6<')?+1"=/+?+"$&(+*'6($,&?" '*+")&+C7+6(+3")&<+??"6,>7'*'($@+"A)'&($-$+*?"'*+"4)$<("$&"(/+"?5&('C1"D$@$&%"'"-)<<5" 6,>7,?$($,&'<"'&'<5?$?"$?"(/+*+-,*+"&,("M)?("6,&6+7()'<<5"'77+'<$&%"4)("'<?,"*+A)$*+3" (," +C7<'$&" &+B" +>7$*$6'<" %+&+*'<$E'($,&?1" =/+" >,*+" %+&+*'<" +&(+*7*$?+" (/'(" (/$?" (/+?$?" /,7+?" 7'@+" (/+" B'5" $?"%$@$&%"'")&$-,*>"'&3"-)<<5"6,>7,?$($,&'<" '&'<5?$?" ,-" 6,>7'*'($@+"A)'&($-$6'($,&'<"?(*)6()*+?"(/'("3,+?"&,("+C$?("?,"-'*1" " =/+?$?"?)7+*@$?,*0"L*+&+":+$>" =$(<+0"N*,-+??,*",-"O$&%)$?($6?" 8" Acknowledgments L("/'?"4++&"'"%*+'("7*$@$<+%+"(,"?()35"'("9L=H"B/$6/"7*,@$3+3">+"B$(/"'&"+&@$*,&>+&(" (," <+'*&" (/'(" L" 6'&Q(" $>'%$&+" 4+$&%" 4+((+*" ?)$(+3" (," +&%'%+" >5" +@+*" 6)*$,)?" >$&31" R'6)<(5H"?()3+&(?"'&3"@$?$(,*?"'<$;+"6*+'(+"'&"$&(+<<+6()'<"'(>,?7/+*+",-"6,<<'4,*'($@+" +--,*("-*,>"B/$6/"L"/'@+"7*,-$(+3"$&">,*+"B'5?"(/'&"6'&"4+"3+?6*$4+3"$&"(/$?"?/,*(" &,(+1".>,&%"(/+"7+,7<+"L"/'@+"4+&+-$(+3"(/+">,?("'*+"I$&"'<7/'4+($6'<",*3+*J"2'<$C(," .%)+**,KS')($?('H" T'*<,?" .**+%$H" #M+-" S'*4$+*?H" U'M+?/" S/'((H" V,&'(/'&" S,4'<M$;H" 9'*$+K2<')3+"S,$@$&H"W,'>"2/,>?;5H"S*$3%+("2,7<+5H"X'@+"Y>4$6;H"T'$"@,&"R$&(+<H" X'&&5" R,CH" Y<+&'" D)+*E,&$H" T+&" :'<+H" 9,**$?" :'<<+H" L*+&+" :+$>H" #'4$&+" L'(*$3,)H" U,)>$" LE@,*?;$KN'&6/+@'H" L3'&" O'&3')H" 9+<(+>" T+<+7$*H" .<+6" 9'*'&(EH" O$?'" 9'((/+B??,&H" V,&" W$??+&4')>H" 9'$*+" W,,&'&H"D$&'"U+&3,&H"V'5"U$-;$&H"Z'5&+" [QW+$<H" R*'&6+?6'" N'&E+*$H" [*$&" N+*6)?H" X'@$3" N+?+(E;5H" W,*@$&" U$6/'*3?H" \<$" #')+*<'&3H" V+'&+((+" #6/'+--+*H" N/$<$77+" #6/<+&;+*H" O$E" #7+<;+H" T+&" Z+C<+*H" #)?$" Z)*>4*'&3H"T'E);/,"]'(E)?/$*,H"'&3">'&5",(/+*?"B/,"B$<<"/,7+-)<<5"-,*%$@+">+"-,*" &,(" >+&($,&$&%" (/+$*" &'>+?1" L(" 3,+?&Q(" 3," >)6/" M)?($6+" (," ?$>7<5" <$?(" (/+" &'>+?" ,-" (/+?+"7+,7<+H"L"/,7+"(/+5";&,B"/,B">)6/"L"'77*+6$'(+"(/+$*"$&(+<<+6()'<"'?"B+<<"'?" 7+*?,&'<"6,>7'&51"" " =/+" 3'&%+*" ,-" <$@$&%" $&" ?)6/" '" ?($>)<'($&%" +&@$*,&>+&(" '?" 9L=" <$+?" $&" %+(($&%" $&(+*+?(+3" $&" (,," >'&5" (/$&%?" '(" (/+" ?'>+" ($>+1" Z/+&" L" 6,)<3&Q(" $%&,*+" (/+" &++3" '&5>,*+"(,"?+((<+",&"'"(/+?$?"7*,M+6("'&3"6,&6+&(*'(+",&"$(H"@+*5"<$((<+"($>+"B'?"<+-(1"L" '>"3++7<5"%*'(+-)<"(,">5"6,>>$((++">+>4+*?"L*+&+":+$>H"T'$"@,&"R$&(+<"'&3"X'&&5" R,C"-,*"(';$&%">+")&3+*"(/+$*"B$&%?"3+?7$(+"(/+"<$((<+"($>+"(/'("B'?"<+-("'&3"(/+">)6/" (,,"'>4$($,)?"7*,M+6("L"/'3"$&">$&31"R,*+>,?("L"B'&("(,"(/'&;"L*+&+"B/,"/'?"4++&" ?)77,*($@+"B$(/"/+*"($>+"'&3"+&+*%5"(,"'">)6/"/$%/+*"3+%*++"(/'&"L"3+?+*@+31":+*" '4$<$(5" (," ?++" (/*,)%/" ,-(+&" 6,&-)?+3" $3+'?" (/+" 6,*+" ,-" ?,>+(/$&%" @'<)'4<+" /+<7+3" >+"$>>+&?+<5"(,";++7",&"%,$&%1"YA)'<<5"$>7,*('&("B'?"/+*"$&6*+3$4<5"'6)(+"?+&?+" -,*" <$&%)$?($6" -'6(?" B/$6/" /+<7+3" >+" ?,*(" (/*,)%/" '" &,(,*$,)?<5" 3$--$6)<(" +>7$*$6'<" 3,>'$&1" #/+" $?" $&" >'&5" B'5?" '" *,<+" >,3+<" ^" >,?(" $>7,*('&(<5" (/,)%/" $&" /+*" #,6*'($6"'77*,'6/"(,"(/+,*$E$&%"B/$6/"7)(?"%*+'("@'<)+"(,")&3+*?('&3$&%"B/+*+"B+" 3,&Q(" )&3+*?('&3" '&5>,*+1" Z,*;$&%" B$(/" T'$" /'?" /+<7+3" >+" %*+'(<5" $&" 3+@+<,7$&%" '&3" ?/'*7+&$&%" $3+'?" (/'(" ?++>+3" >,*+" <$;+" -,%%5" $>7*+??$,&?" 4+-,*+" ('<;$&%" (," /$>1" O,,;$&%" 4'6;" L" B$?/" L" /'3" /'3" >,*+" ($>+" 3$?6)??$&%" (/$&%?" B$(/" /$>1" Y@+&" (/,)%/" ,*" 7*,4'4<5" 4+6')?+" B+" B+*+" -+<<,B"?()3+&(?",@+*"(/*++"5+'*?H"X'&&5"$?" 7*,4'4<5"(/+"7+*?,&"L"<+'*&+3">,?("-*,>"3)*$&%"(/+"($>+"L"?7+&("'("9L=1":$?"'4$<$(5"(," ?++"(/*,)%/"6,&@,<)(+3"(/+,*$+?"'&3"6,>7<$6'(+3"-'6(?"(/+"4'*+"4,&+"?(*)6()*+",-"'" (/+,*5",*"'&"'*%)>+&("/'?"/+<7+3">+"$>>+&?+<5"3)*$&%"6<'??+?"'&3"7*,M+6(?"'?"B+<<" " P '?" 3)*$&%" B*$($&%" (/+" (/+?$?1" N*,4'4<5" +@+&" >,*+" $>7,*('&(" $?" /$?" '&3" V,&" W$??+&4')>Q?"-*$+&3?/$71"L"6'&Q("$>'%$&+"?)*@$@$&%"(/+"+@+*"7*+?+&("7*+??)*+"'("9L=" B$(/,)("(/+$*"/+<7H"+&6,)*'%+>+&("'&3"'3@$6+1"=,"/'@+"/'3"V,&"'?",--$6+">'(+"-,*"`" 5+'*?"/'?"4++&"'"B,&3+*-)<"7*$@$<+%+H"4,(/"$&(+<<+6()'<<5"'?"B+<<"'?"7+*?,&'<<51"=/+" &)>+*,)?" 3$?6)??$,&?" (/+" (/*++" ,-" )?" /'3" ,&" '<<" ?,*(?" ,-" $??)+?" $&" <$&%)$?($6?" '&3" >'((+*?">)6/">,*+"$>7,*('&("(/'&"(/'("/'@+"3++7<5"?/'7+3">5"B'5",-"(/$&;$&%1"" " L("B,)<3"&,("/'@+"4++&"7,??$4<+"-,*">+"(,"6,>+"(,"9L="B+*+"$("&,("-,*"(/+"%+&+*,)?" ?)77,*(" L" *+6+$@+3" -*,>" U$'" X+S<+?+*H" Z,<-%'&%" X*+??<+*H" 9'*($&" N*$&E/,*&" '&3" 2/*$?" #6/'&+*KZ,<<+?" 3)*$&%" >5" )&3+*%*'3)'(+" ?()3$+?" $&" a$+&&'" '&3" .'6/+&1" #7+6$'<" (/'&;?" %," (," 9'*($&" N*$&E/,*&" '&3" /$?" ?5&('C" %*,)7" K" 2/*$?($&+" 2E$&%<'*H" R)EE$"R,<($&H"9'*($&":'$3+&H"T'(/'*$&'"T,+/<+*H"Z$&&$+"O+6/&+*H"R*$+3*$6/"W+)4'*(H" 9'*($&'" Z$<(?6/;," '&3" #)?$" Z)*>4*'&3" G" -,*" B+<6,>$&%" >+" $&(," (/+$*" %*,)7" '&3" +&6,)*'%$&%" >+" (," 4+<$+@+" (/'(" L" B'?&Q(" (,," ?()7$3" -,*" <$&%)$?($6?1" 9'*($&" N*$&E/,*&" /'?"'<?,"'**'&%+3"-,*">+"(,"%,"(,".'6/+&"'&3"B,*;"B$(/"U$'"X+S<+?+*"'?"7'*(",-">5" 9."(/+?$?"'&3"<'(+*",&"-,*">+"(,"@$?$("\#21"S,(/"+C7+*$+&6+?"/'@+"4++&"+??+&($'<"-,*" >+"(,"+@+&"6,&?$3+*"%*'3)'(+"?6/,,<"$&"<$&%)$?($6?"'&3"L"'>"@+*5"%*'(+-)<"-,*"/'@$&%" %,((+&"(/+?+",77,*()&$($+?1" " L"'<?,"B'&("(,"(/'&;">5"7'*+&(?"V,/'&&"'&3"2/*$?($&+":'6;<H">5"?$4<$&%?"'&3"(/+$*" 6/$<3*+&" '&3" (/+" *+?(" ,-" (/+" -'>$<5" 4'6;" $&" .)?(*$'" -,*" (/+$*" ?)77,*(" (/*,)%/,)(" (/+" 5+'*?"'&3"-,*"7*,@$3$&%">+"B$(/"'"7+*?7+6($@+",&"<$-+"(/'("$?"?,"+'?$<5"-,*%,((+&"$&"(/+" /$%/"?(*)&%"<$-+",-"'&"'?7$*$&%"'6'3+>$61"95"3++7+?("(/'&;?"%,"(,"Y<+&'"D)+*E,&$" B/,"/'?"4++&",&">5"?$3+",@+*"(/+"<'?("(B,"5+'*?"?)77,*($&%">+"$&"?,">'&5"B'5?" (/'("L"4<)?/"(/$&;$&%"'4,)("$("^"'&3"B/,"/'?"'<<,B+3">+"(,"4+",&"/+*"?$3+"B/$6/"$?" (/+"%*+'(+?("7*$@$<+%+"L"6'&"$>'%$&+1""=/'&;"5,)"-,*"4+$&%"(/+"?)&?/$&+",-">5"<$-+1" " _ Table of Contents " Abstract 11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 2 Acknowledgements 11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 3 Table of Contents 111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 5 Chapter 1 Amount Comparison and Quantification: Basic Questions 1.1 Introduction 111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 b 1.2 Background Assumptions and Notational Conventions 1111111111111111111 !_ 1.3 Comparative Quantifiers in Generalized Quantifier Theory 1111111111111 !c" !1P1!"#,>+"N*,7+*($+?",-"2,>7'*'($@+"F)'&($-$6'($,& 111111111111111111111111111111111 "8d" !1P18"YC(+&?$,&"(,"PK"'&3"_K7<'6+"2,>7'*'($@+"F)'&($-$+*?" 111111111111111111111111 "Pc" 1.4 Comparative Quantifiers as Comparative Constructions 111111111111111111
Load more

Recommended publications
  • Notes on Generalized Quantifiers
    Notes on generalized quantifiers Ann Copestake ([email protected]), Computer Lab Copyright c Ann Copestake, 2001–2012 These notes are (minimally) adapted from lecture notes on compositional semantics used in a previous course. They are provided in order to supplement the notes from the Introduction to Natural Language Processing module on compositional semantics. 1 More on scope and quantifiers In the introductory module, we restricted ourselves to first order logic (or subsets of it). For instance, consider: (1) every big dog barks 8x[big0(x) ^ dog0(x) ) bark0(x)] This is first order because all predicates take variables denoting entities as arguments and because the quantifier (8) and connective (^) are part of standard FOL. As far as possible, computational linguists avoid the use of full higher-order logics. Theorem-proving with any- thing more than first order logic is problematic in general (though theorem-proving with FOL is only semi-decidable and that there are some ways in which higher-order constructs can be used that don’t make things any worse). Higher order sets in naive set theory also give rise to Russell’s paradox. Even without considering inference or denotation, higher-order logics cause computational problems: e.g., when deciding whether two higher order expressions are potentially equivalent (higher-order unification). However, we have to go beyond standard FOPC to represent some constructions. We need modal operators such as probably. I won’t go into the semantics of these in detail, but we can represent them as higher-order predicates. For instance: probably0(sleep0(k)) corresponds to kitty probably sleeps.
    [Show full text]
  • Generalized Quantifiers and Dynamicity — Preliminary Results —
    Generalized Quantifiers and Dynamicity — preliminary results — Clement´ Beysson∗ Sarah Blind∗ Philippe de Groote∗∗ Bruno Guillaume∗∗ ∗Universite´ de Lorraine ∗∗Inria Nancy - Grand Est France France Abstract We classify determiners according to the dynamic properties of the generalized quanti- fiers they denote. We then show how these dynamic generalized quantifiers can be defined in a continuation-based dynamic logic. 1 Introduction Following the success of the interpretation of determiners as binary generalized quantifiers (Bar- wise and Cooper, 1981), on the one hand, and the success of DRT (Kamp and Reyle, 1993) and dynamic logic (Groenendijk and Stokhof, 1991), on the other hand, several authors have ex- plored notions of dynamic generalized quantifiers (Chierchia, 1992; Fernando, 1994; Kanazawa, 1994a,b; van den Berg, 1991, 1994; van Eijck and de Vries, 1992). In this paper, we revisit this subject in the setting of the dynamic framework introduced in (de Groote, 2006). We classify the generalized quantifiers that are denotations of determiners according to their dynamic properties (internal dynamicity, external dynamicity, and intrinsic dynamicity). We end up with three classes of dynamic generalized quantifiers, and we show how they can be formally defined in the simple theory of types (Church, 1940). To conclude, we discuss several issues raised by the proposed formalization. 2 A classification of the generalized quantifiers according to their dynamic properties We consider binary dynamic generalized quantifiers that are used as denotations of determiners. In our dynamic setting (de Groote, 2006; Lebedeva, 2012), a quantifier belonging to this class, say Q, is a constant (or a term) of type: (1) Q : (i ! W) ! (i ! W) ! W where i is the type of individuals, and W the type of dynamic propositions.
    [Show full text]
  • Conjunction Is Parallel Computation∗
    Proceedings of SALT 22: 403–423, 2012 Conjunction is parallel computation∗ Denis Paperno University of California, Los Angeles Abstract This paper proposes a new, game theoretical, analysis of conjunction which provides a single logical translation of and in its sentential, predicate, and NP uses, including both Boolean and non-Boolean cases. In essence it analyzes conjunction as parallel composition, based on game-theoretic semantics and logical syntax by Abramsky(2007). Keywords: conjunction, quantifier independence, game theoretic semantics 1 Introduction An adequate analysis of conjunction and should provide a uniform analysis of the meaning of and across its various uses. It should apply to various instances of coordinate structures in a compositional fashion, and capture their interpretational properties. In this paper I develop a proposal that unifies Boolean conjunction of sentences with collective (plural), branching, as well as respectively readings of coordinate NPs. A well-known problem for the Boolean approach to conjunction (Gazdar 1980; Keenan & Faltz 1985; Rooth & Partee 1983) are plural readings of coordinate NPs, as in John and Mary are a nice couple, which occur in the context of collective (group) predicates. While in many contexts John and Mary can be interpreted as a generalized quantifier Ij ^ Im, predicates like meet, be a nice couple, be the only survivors etc. force a group construal of coordinate referential NPs. And applied to properly quantified NPs can produce a quantifier branching reading (Barwise 1979). Sum formation can be seen as a special case of branching: essentially, plurality formation is branching of Montagovian individuals. I will focus here on NPs with distributive universal quantifiers, such as: (1) Every man and every woman kissed (each other).
    [Show full text]
  • GENERALIZED QUANTIFIERS, and BEYOND Hanoch Ben-Yami
    GENERALIZED QUANTIFIERS, AND BEYOND 1 Hanoch Ben-Yami ABSTRACT I show that the contemporary dominant analysis of natural language quantifiers that are one-place determiners by means of binary generalized quantifiers has failed to explain why they are, according to it, conservative. I then present an alternative, Geachean analysis, according to which common nouns in the grammatical subject position are logical subject-terms or plural referring expressions, and show how it does explain that fact and other features of natural language quantification. In recent decades there has been considerable advance in our understanding of natural language quantifiers. Following a series of works, natural language quantifiers that are one-place determiners are now analyzed as a subset of generalized quantifiers: binary restricted ones. I think, however, that this analysis has failed to explain what is, according to it, a significant fact about those quantifiers; namely, why one-place determiners realize only binary restricted quantifiers, although the latter form just a small subset of the totality of binary quantifiers. The need for an explanation has been recognized in the literature; but, I shall argue, all the explanations that have been provided fail. By contrast to this analysis, a Geachean analysis of quantification, according to which common nouns in the grammatical subject position are logical subject-terms or plural referring expressions, does explain this fact; in addition, it also explains the successes and failure of the generalized quantifiers analysis. I present the Geachean analysis below and develop these explanations. In this way, the fact that only specific quantifiers of all logically possible ones are realized in natural language is emphasized as one that should be explained; and the ability of competing theories to supply one should be a criterion for deciding between them.
    [Show full text]
  • The Bound Variable Hierarchy and Donkey Anaphora in Mandarin Chinese
    The Bound Variable Hierarchy and Donkey Anaphora in Mandarin Chinese Haihua Pan and Yan Jiang City University of Hong Kong / London University Cheng and Huang (1996) argue that both unselective binding and E-type pro- noun strategies are necessary for the interpretation of natural language sentences and claim that there exists a correspondence between two sentence types in Chinese and the two strategies, namely that the interpretation of the “wh … wh” construction (which they call “bare conditional”) employs the unselective binding strategy, while the ruguo ‘if’ and dou ‘all’ conditionals use the E-type pronoun strategy. They also suggest that there is a complementary distribution between bare conditionals and ruguo/dou conditionals in the sense that the lat- ter allows all the NP forms, e.g. (empty) pronouns and definite NPs, except for wh-phrases in their consequent clauses, and can even have a consequent clause with no anaphoric NP in it, while the former permits only the same wh-phrase appearing in both the antecedent clause and the consequent clause. Although we agree with Cheng and Huang on the necessity of the two strategies in natural language interpretation, we see apparent exceptions to the correspondence between sentence types and interpretation strategies and the complementary distribution between wh-phrases and other NPs in bare conditionals and ruguo/dou conditionals. We think that the claimed correspondence and comple- mentary distribution are the default or preferred patterns, or a special case of a more general picture, namely that (i) bare conditionals prefer the unselective binding strategy and the ruguo ‘if’ and dou ‘all’ conditionals, the E-type pronoun strategy; and (ii) wh-phrases are more suitable for being a bound variable, and pronouns are more suitable for being the E-type pronoun.
    [Show full text]
  • Lecture 5. Noun Phrases and Generalized Quantifiers
    Formal Semantics, Lecture 5 Formal Semantics, Lecture 5 Barbara H. Partee, RGGU March 25, 2004 p. 1 Barbara H. Partee, RGGU March 25, 2004 p. 2 Lecture 5. Noun Phrases and Generalized Quantifiers It is a fact of logic ((Curry 1930), Schönfinkel; see (Kneale and Kneale 1962)) that any function which applies to two arguments can be equivalently replaced by a function that 1. Function-argument structure, syntactic categories, and semantic types. ...........................................................1 applies to one argument and gives as result another function which applies to the other 2. NPs as Generalized Quantifiers. (continued).....................................................................................................2 argument, so in place of the original f(x,y) = z we can have f’(y)(x) = z , where the value of 3. Semantic explanations of linguistic phenomena: a case study............................................................................4 f’(y) itself is a function that applies to x. 3.1. “Weak” determiners and existential sentences (there-sentences). ..............................................................4 3.2. Weak determiners in Russian – how to test? ...............................................................................................6 3.2.1. Questions and preliminary hypotheses. ................................................................................................6 (Note: we want to apply the verb to its “second” argument first, because the verb combines 3.2.2 Results of seminar
    [Show full text]
  • A Double Team Semantics for Generalized Quantifiers
    J Log Lang Inf (2015) 24:149–191 DOI 10.1007/s10849-015-9217-4 A Double Team Semantics for Generalized Quantifiers Antti Kuusisto1,2 Published online: 28 April 2015 © The Author(s) 2015. This article is published with open access at Springerlink.com Abstract We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of a generalized atom. We define a system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework. The semantics is based on pairs of teams, or double teams. We also devise a game-theoretic semantics equivalent to the double team semantics. We make use of the double team semantics by defining a logic DC2 which canonically fuses together two-variable dependence logic D2 and two-variable logic with counting quantifiers FOC2. We establish that the satisfiability and finite satisfiability problems of DC2 are complete for NEXPTIME. Keywords Team semantics · Dependence logic · Generalized quantifiers · Game-theoretic semantics Part of this work was carried out during a tenure of the ERCIM Alain Bensoussan Fellowship Programme. The reported research has received funding from the European Union Seventh Framework Programme (FP7/2007–2013) under grant agreement number 246016. The author also acknowledges funding received from the Jenny and Antti Wihuri Foundation. B Antti Kuusisto [email protected] 1 Institute of Computer Science, University of Wrocław, ul. Joliot-Curie 15, 50-383 Wroclaw, Poland 2 Department of Philosophy, Stockholm University, 10-691 Stockholm, Sweden 123 150 A. Kuusisto 1 Introduction Independence-friendly logic is an extension of first-order logic motivated by issues concerning Henkin quantifiers and game-theoretic semantics.
    [Show full text]
  • Generalized Quantifiers: Linguistics Meets Model Theory
    Generalized Quantifiers: Linguistics meets Model Theory Dag Westerst˚ahl Stockholm University 0.1 Thirty years of Generalized Quantifiers 3 0.1 Thirty years of Generalized Quantifiers It is now more than 30 years since the first serious applications of Gener- alized Quantifier (GQ) theory to natural language semantics were made: Barwise and Cooper (1981), Keenan and Stavi (1986), Higginbotham and May (1981). Richard Montague had in effect interpreted English NPs as (type h1i) generalized quantifiers (see Montague (1974)),1 but without referring to GQs in logic, where they had been introduced by Mostowski (1957) and, in final form, Lindstr¨om(1966). Logicians were interested in the properties of logics obtained by piecemeal additions to first-order logic (FO) by adding quantifiers like `there exist uncoutably many', but they made no connection to natural language.2 Montague Grammar and related approaches had made clear the need for higher- type objects in natural language semantics. What Barwise, Cooper, and the others noticed was that generalized quantifiers are the natural inter- pretations not only of noun phrases but in particular of determiners.3 This was no small insight, even if it may now seem obvious. Logi- cians had, without intending to, made available model-theoretic ob- jects suitable for interpreting English definite and indefinite articles, the aristotelian all, no, some, proportional Dets like most, at least half, 10 percent of the, less than two-thirds of the, numeri- cal Dets such as at least five, no more than ten, between six and nine, finitely many, an odd number of, definite Dets like the, the twelve, possessives like Mary's, few students', two of every professor's, exception Dets like no...but John, every...except Mary, and boolean combinations of all of the above.
    [Show full text]
  • Introduction to Generalized Quantifier Theory
    Introduction to Generalized Quantifier Theory Jakub Szymanik Institute for Logic, Language and Computation University of Amsterdam EGG 2013 Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here. Eleonora Nina Sama Peter Juha Jakub Jonathan Henk Michael Anton Reinhard Tikitu Quantifiers are useful Everyone knows everyone here.
    [Show full text]
  • DOMAINS of QUANTIFICATION and SEMANTIC TYPOI.DGY* Barbara
    DOMAINS OF QUANTIFICATION AND SEMANTIC TYPOI.DGY* Barbara H. Partee University of Massachusetts/Amherst 1. Background and central issucsl The questions I am ~oncerned with here arise from the interaction of two broad areas of current research in syntax and semantics. One area, a very old one, concerns the systematic semantic import of syntactic categories, a question requiring a· combination of theoretical work and cross-linguistic study. The other area, only recently under active investigation, concerns the structure and interpretation of expressions of quantification, including not only quantification expressed by NP's with determiners like "every" and "no" but also what Lewis 1975 called "adverbs of quantification" ("always", "in most cases", "usually", etc.), "floated" quantifiers, and quantifiers expressed by verbal affixes and auxiliaries. At the intersection of these two areas are pressing questions which seem ripe for intensive investigation. Some key questions noted by Partee, Bach, and Kratzer 1987 are the following: (1) Is the use of NP's as one means of expressing quantification universal, as proposed by Barwlse and Cooper 1981? Does every language employ some other klnd(s) of quantification? Is there some kind of quantification that every language employs? Our current hypothesis ls that the answer to the first of these questions is llQ., to the second ~; the third ls still entirely open. One goal of current research ls the formulation of a finer-grained, possibly lmplicatlonal hypothesis in place of Barwlse and Cooper's categorical universal. (2) What are the similarities and differences, within and across language.s, in the structure and interpretation of quantification expressed with NP's and quantification expressed with "floated" quantifiers, sentence adverbs, verbal affixes, auxiliaries, or other non-NP means? 1.1 ~ semantics 2.f syntactic categories: background 1.1.1 Traditional linguistics YIL.
    [Show full text]
  • Epistemic Modality, Mind, and Mathematics
    Epistemic Modality, Mind, and Mathematics Hasen Khudairi June 20, 2017 c Hasen Khudairi 2017, 2021 All rights reserved. 1 Abstract This book concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality relates to the computational theory of mind; metaphysical modality; the types of math- ematical modality; to the epistemic status of undecidable propositions and abstraction principles in the philosophy of mathematics; to the modal pro- file of rational intuition; and to the types of intention, when the latter is interpreted as a modal mental state. Chapter 2 argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation be- tween modal cognitivism and modal expressivism. Chapter 3 provides an abstraction principle for epistemic intensions. Chapter 4 advances a two- dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter 5 applies the modal µ-calculus to account for the iteration of epistemic states, by contrast to availing of modal axiom 4 (i.e. the KK principle). Chapter 6 advances a solution to the Julius Caesar problem based on Fine’s "cri- terial" identity conditions which incorporate conditions on essentiality and grounding. Chapter 7 provides a ground-theoretic regimentation of the pro- posals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism.
    [Show full text]
  • Bound-Variable Pronouns and the Semantics of Number Hotze Rullmann University of Calgary
    In Brian Agbayani, Paivi Koskinen, and Vida Samiian (eds.). 2003. Proceedings of the Western Conference on Linguistics: WECOL 2002. Department of Linguistics, California State University, Fresno, pp. 243-254. Bound-Variable Pronouns and the Semantics of Number Hotze Rullmann University of Calgary 1. Introduction In sentences like (1a,b) the plural pronoun they appears to function semantically as a bound variable ranging over singular individuals rather than pluralities.1 Both sentences are truth-conditionally equivalent to (2a) in which the pronoun is morphologically singular. This suggests that semantically they involve universal quantification over an individual variable, as in the logical representation (2b). (1) a. All men1 think they1 are smart. b. The men1 all think they1 are smart. (2) a. Every man1 thinks he1 is smart. b. ∀x[man(x) → x thinks x is smart] The idea that a plural bound pronoun can represent a singular variable appears to be supported by examples such as (3) and (4a) in which the property predicated of the bound pronoun can only be true of one individual, either because of certain contingent facts (only one candidate can win a presidential election), or for logical reasons (only one person can be the smartest person in the world). Note that the embedded clause of (4a) is odd when used as an independent sentence in which they is not a bound variable, as in (4b). (3) All candidates thought they could win the presidential election. (4) a. All men think they are the smartest person in the world. b. # They are the smartest person in the world.
    [Show full text]