Scope parallelism in coordination in Dependent Type Semantics

Size: px
Start display at page:

Download "Scope parallelism in coordination in Dependent Type Semantics"

Transcription

1 Scope parallelism in coordination in Dependent Type Semantics Yusuke Kubota 1 Robert Levine 2 1 University of Tsukuba, Ohio State University 2 Ohio State University LENLS 12 Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 1 / 27

2 Outline The Geach RNR problem: overview Problems with prior accounts of Geach quick review of Hybrid TLCG The Geach problem in Hybrid TLCG [Steedman, 2012] s (non-)solution in CCG nalysis in Hybrid TLCG + Dependent Type Semantics Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 2 / 27

3 The Geach data [Geach, 1972] (1) Every boy admires, and every girl detests, some saxophonist ( > > ; > > ) NB: (1) lacks readings in which the RNR ed existential scopes above the universal in one conjunct but below it in the other conjunct Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 3 / 27

4 The Geach data [Geach, 1972] (1) Every boy admires, and every girl detests, some saxophonist ( > > ; > > ) NB: (1) lacks readings in which the RNR ed existential scopes above the universal in one conjunct but below it in the other conjunct The scope parallelism problem in Geach sentences is not restricted to RNR, since cases such as (2), first noted in [Hirshbühler, 1982], show that it holds in VP ellipsis as well (2) Canadian flag was hanging in front of every window and an merican flag was too Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 3 / 27

5 Rules in Hybrid TLCG Connective Introduction Elimination / [ϕ; x; ] n b ϕ; F ; B /I n b; λxf ; B/ a; F ; /B b; G; B /E a b; F (G); \ [ϕ; x; ] n ϕ b; F ; B \I n b; λxf ; \B [ϕ; x; ] n b; F ; B λϕb; λxf ; B I n b; G; B a; F ; B\ \E b a; F (G); a; F ; B b; G; B E a(b); F (G); Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 4 / 27

6 Quantifiers and Slanting We follow [Oehrle, 1994] and much subsequent work in his framework (see also [Muskens, 2003], [de Groote, 2001]) in taking generalized quantifiers to have the form in (3): (3) λϕλσσ(some ϕ); λq (where E E Q; S (S NP) Q = def λp xq(x) P (x)) But it follows as an Hybrid TLCG theorem that from this form, by hypothetical reasoning, we can infer a variety of directional versions, eg (S/NP)\S: (4) λσ 1 σ 1 (some saxophonist); E sax; S (S NP) ϕ 1 ; P ; S/NP ϕ 2 ; x; NP ϕ 1 ϕ 2 ; P (x); S λϕ 2 ϕ 1 ϕ 2 ; λxp (x); S NP ϕ 1 some saxophonist; sax(λxp (x)); S some saxophonist; λp sax(λxp (x)); (S/NP)\S E E Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 5 / 27

7 Getting the Geach readings in Hybrid TLCG > > (5) ϕ 2 admires; λwadmire(w)(v); S/NP [ϕ 1 ; V ; (S/NP)\S] 1 ϕ 2 admires ϕ 1 ; V (λwadmire(w)(v)); S λϕ 2 ϕ 2 admires ϕ 1 ; λvv (λwadmire(w)(v)); S NP every boy admires ϕ 1 ; λσ 1 σ 1 (every boy); boy; S (S NP) boy(λvv (λwadmire(w)(v))); S every boy admires; λv boy(λvv (λwadmire(w)(v))); S/((S/NP)\S) In parallel fashion we obtain (6) every girl detests; λu S/((S/NP)\S) girl(λzu (λudetest(u)(z))); s usual, we take coordination to correspond in general to Partee and Rooth s generalized conjunction and disjunction operators, Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 6 / 27

8 which yields (7) every boy admires and every girl detests; λw boy(λzw (λxadmire(x)(z))) girl(λzw (λxdetest(x)(z))); S/((S/NP)\S) When (7) combines as argument with the slanted version of some saxophonist derived in (4), we get the reading in which the latter s denotation is distributed over the conjunction (4) some saxophonist; λp E sax(λxp (x)); (S/NP)\S Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 7 / 27

9 > We derive the alternative scoping more simply, as follows every boy admires ϕ 1; every boy admires; λx boy(λyadmire(y)(x)); S boy(λyadmire(y)(x)); S/NP and the same for every girl detests; λx girl(λydetest(y)(x)); S/NP which, under generalized conjunction, together yield every boy admires and every girl detests; λw boy(λyadmire(y)(w)) girl(λzdetest(z)(w)); S/NP every boy admires and every girl detests ϕ 2; boy(λyadmire(y)(v)) girl(λzdetest(z)(v)); S λϕ 2every boy admires and every girl detests ϕ 2; λv boy(λyadmire(y)(v)) girl(λzdetest(z)(v)); S NP ϕ 2; v; NP λσ 1σ 1(some saxophonist); E sax; S (S NP) every boy admires and every girl detests some saxophonist; sax(λv boy(λyadmire(y)(v)) girl(λzdetest(z)(v))); S E Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 8 / 27

10 Mixed readings But note that the following sign is also derivable: every girl detests; λu U (λw girl(λzdetest(w)(z))); S/((S/NP)\S) which is of the same syntactic type as what we derived earlier for the distributed interpretation of the RNRed indefinite: every boy admires; λv boy(λvv (λwadmire(w)(v))); S/((S/NP)\S) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 9 / 27

11 Mixed readings But note that the following sign is also derivable: every girl detests; λu U (λw girl(λzdetest(w)(z))); S/((S/NP)\S) which is of the same syntactic type as what we derived earlier for the distributed interpretation of the RNRed indefinite: every boy admires; λv Conjoining them yields: boy(λvv (λwadmire(w)(v))); S/((S/NP)\S) (8) every boy admires and every girl detests; λw boy(λvw (λwadmire(w)(v))) W (λu girl(λzdetest(u)(z)); S/((S/NP)\S)) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 9 / 27

12 Mixed readings But note that the following sign is also derivable: every girl detests; λu U (λw girl(λzdetest(w)(z))); S/((S/NP)\S) which is of the same syntactic type as what we derived earlier for the distributed interpretation of the RNRed indefinite: every boy admires; λv Conjoining them yields: boy(λvv (λwadmire(w)(v))); S/((S/NP)\S) (8) every boy admires and every girl detests; λw boy(λvw (λwadmire(w)(v))) W (λu girl(λzdetest(u)(z)); S/((S/NP)\S)) pplied to the slanted form of some saxophonist, we will obtain (9) every boy admires and every girl detests some saxophonist; boy(λv sax(λwadmire(w)(v))) sax(λu girl(λzdetest(u)(z)); S E E which is the unavailable mixed reading Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 9 / 27

13 Steedman s solution: Skolem terms Steedman proposes a CCG solution for the Geach problem reinterpretating existentials not as generalized quantifiers but rather generalized Skolem terms corresponding either to constants (with wide scope) when unbound, or functional terms containing variables which become bound when in the scope of a universal Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 10 / 27

14 RNR revisited Steedman s solution for the Geach sentence facts hinges on the fact that a given Skolem term must correspond either a constant or a function on the value of the variable bound by some universal (10) In (10), the determination of which of these possibilities is realized (Skolem specification) is made only FTER the RNRed element combines with the S/NP conjunction and is distributed under the scope of the universal in conjunct at the point Every boy admires and every girl detests S/NP : λx y[boy (y) admire (x)(y)] z[girl (z) detest (x)(z)] some saxophonist (S/NP )\S : λqq(skolem (sax )) S : y[boy (y) admire (skolem (sax ))(y)] z[girl (z) detest (skolem (sax ))(z)] S : y[boy (y) admire (sk (y) sax )(y)] Hence both Skolem terms are interpreted as varying functions, corresponding to narrow scope under each universal But if the original Skolem term s status is specified BEFORE λ-conversion distributes it among the conjuncts, it will not be under any quantifier s scope, and hence will be a constant, scoping wide Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 11 / 27

15 Empirical problems with Steedman s account While Steedman s analysis blocks the mixed reading the means by which it does so rule out in advance any possibility of an existential scoping narrowly with respect to the RNR coordination but widely with respect to a universal in either or both conjuncts because if it s a constant, it outscopes everything, and if it s not, it must be under the scope of some universal But examples of just this sort, ruled by the Skolem term analysis, are readily available Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 12 / 27

16 (11) Every merican respects, and every Japanese admires, some novelist namely, their respective most recent Nobel Prize winner The crucial part of the interpretation can be paraphrased as There is some merican novelist such that very merican respects that novelist and there is some Japanese novelist such that every Japanese person respects that novelist so that the existential interpretation distributes over the conjunction (like a Skolem function), but within each conjunct takes widest scope (like a constant) Hybrid TLCG however can license (11) unproblematically, so that Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 13 / 27

17 we are left in the unsatisfactory situation of either blocking mixed readings for Geach sentences but undergenerating (11) (via the CCG analysis), or licensing (11) and while overgenerating the mixed Geach reading (via Hybrid TLCG) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 14 / 27

18 Solution for the Geach puzzle in words (12) Every boy admires, and every girl detests, some saxophonist ( > > ; > > ) (13) Every boy i is such that there is a saxophonist j such that he i admires him j, and every girl k is such that there is a saxophonist l such that she k admires him l Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 15 / 27

19 Solution for the Geach puzzle in words (12) Every boy admires, and every girl detests, some saxophonist ( > > ; > > ) (13) Every boy i is such that there is a saxophonist j such that he i admires him j, and every girl k is such that there is a saxophonist l such that she k admires him l Note that the same interpretive parallelism holds in binding: (14) Every Englishman respects, and every merican loves, his mother (14) doesn t mean: Every Englishman respects his own mother and every merican respects x, where x is some contextually salient person s mother Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 15 / 27

20 naphora in DTS (15) man entered He sat down (16) [ ] x : Ent λc v : u : Man(x) Enter(π 1 u) SitDown(@ 1 (c, v)) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 16 / 27

21 naphora in DTS (15) man entered He sat down (16) [ ] x : Ent λc v : u : Man(x) Enter(π 1 u) SitDown(@ 1 (c, 1 = λcπ 1 π 1 π 2 1 (c, v) = π 1 π 1 v Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 16 / 27

22 naphora in DTS (15) man entered He sat down (16) [ ] x : Ent λc v : u : Man(x) Enter(π 1 u) SitDown(@ 1 (c, 1 = λcπ 1 π 1 π 2 1 (c, v) = π 1 π 1 v Note: The analysis of anaphora resolution is from [Bekki, 2014] [ ] x : Ent We sometimes write [(x : Ent) Man(x)] for Man(x) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 16 / 27

23 Mixed binding problem isn t a problem [Bekki, 2014] (17) Each of John and Bill loves his father Reading 1: John loves his own father and Bill loves his own father Reading 2: Both John and Bill love the same person s father Unavailable reading: John loves his own father and Bill loves somebody else s father Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 17 / 27

24 Mixed binding problem isn t a problem [Bekki, 2014] (17) Each of John and Bill loves his father Reading 1: John loves his own father and Bill loves his own father Reading 2: Both John and Bill love the same person s father Unavailable reading: John loves his own father and Bill loves somebody else s father (18) [ x : Ent λcl(j, π 1 ((@ 1 : γ 1 FatherOf(x, (@ 0 : γ 0 e)(c, j)) [ x : Ent L(b, π 1 ((@ 1 : γ 1 FatherOf(x, (@ 0 : γ 0 e)(c, b)) ] )(c, j))) ] )(c, b))) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 17 / 27

25 Hybrid TLCG + DTS (19) a λϕλσσ(every ϕ); λp λqλc(u : [(x : Ent) P xc]) Q(π 1 u)(c, u); S (S NP) N [ b λϕλσσ(some ϕ); λp λqλc S (S NP) N u : [(x : Ent) P xc] Q(π 1u)(c, u) c λσσ(it); λp λcp (@ 1 1 c); S (S NP) ] ; Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 18 / 27

26 Donkey anaphora (20) λϕλσ σ(every ϕ); λp λqλc (v : h x : Ent P xc i ) Q(π 1 v)(c, v); S (S NP) N farmer; λxλc Fx; N λσwho σ(ε); λp λqλxλc Qxc P xc; (N\N) (S NP) λσσ(a donkey); λqλc "» # y : Ent u : Dy ; Q(π 1 u)(c, u) S (S NP) who owns a donkey; λqλxλcqxc " ϕ1; # 1 x; NP ϕ 1 h owns a donkey; u : [(y : Ent) Dy] λc O(x, π 1 u) " ϕ2; # 2 y; NP λϕ 2ϕ 1 owns ϕ 2; λyλco(x, y); S NP i ; S λϕ 1ϕ h 1 owns a donkey; i u : [(y : Ent) Dy] λxλc O(x, π 1 u) ; S NP h u : [(y : Ent) Dy] O(x, π 1 u) farmer who owns a donkey; λxλcfx h u : [(y : Ent) Dy] O(x, π 1 u) i ; N λσσ(every " farmer who owns a donkey); # x : Ent» λqλc(v : u : [(y : Ent) Dy] Fx ) Q(π 1 v)(c, v); S (S NP) O(x, π 1 u) i ; N\N Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 19 / 27

27 Donkey anaphora (cont) (21) λσσ(every farmer who owns a donkey); λqλc(v :» x : Ent Fx» u : [(y : Ent) Dy] O(x, π 1 u) Q(π 1v)(c, v); S (S NP) ) λσσ(it); λp λcp (@ 1c) 1c); S (S NP) h ϕ3; i 3 z; NP h ϕ4; i 4 w; NP λϕ 4ϕ 3 beats ϕ 4; λwλcb(z, w); S NP ϕ 3 beats it; 1c); S λϕ 3ϕ 3 beats it; 1c); S NP every farmer who owns a donkey beats it; λc(v :» x : Ent» u : [(y : Ent) Dy] Fx O(x, π 1 u) ) B(π 1(c, v)); S Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 20 / 27

28 Binding parallelism (22) Every Englishman respects, and every merican loves, his mother (23)» x : Ent λc(u : E(x)» x : Ent (u : (x)» y : Ent ) R(π 1u, π 1((@ 1 : γ 1 ) L(π 1u, π 1((@ 1 : γ 1 M(y, (@ 0 : γ 0 e)(c, u))» y : Ent M(y, (@ 0 : γ 0 e)(c, u)) )(c, u))) )(c, u))) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 21 / 27

29 Revised entry for the existential quantifier (24) a it; λc@ i c; NP p b admires; λfλxλc(x, fc); (NP\S)/NP p [ u : [(x : Ent) P xc] (25) λϕλσσ(some ϕ); λp λqλc Q(λd@ π 1u i d)(c, u) S (S NP p ) N ] ; where, for all contexts π 1u i c = c i c = π 1 u undefined otherwise Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 22 / 27

30 Revised entry for the existential quantifier (24) a it; λc@ i c; NP p b admires; λfλxλc(x, fc); (NP\S)/NP p [ u : [(x : Ent) P xc] (25) λϕλσσ(some ϕ); λp λqλc Q(λd@ π 1u i d)(c, u) S (S NP p ) N ] ; where, for all contexts π 1u i c = c i c = π 1 u undefined otherwise Cf older entry: [ u : [(x : Ent) P xc] (26) λϕλσσ(some ϕ); λp λqλc Q(π 1u)(c, u) S (S NP) N ll quantifier entries will be revised accordingly, but for expository ease, below we replace the entries of the relevant quantifiers only Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 22 / 27 ] ;

31 Simple sentence involving a quantifier (27) λϕλσσ(every boy); λqλc(v : [(x : Ent) Bx]) Q(π 1v)(c, v); S (S NP) λσσ(some» saxophonist); u : [(x : Ent) Sx] λqλc Q(λd@ π 1u 1 d)(c, u) S (S NP p) ; h ϕ1; i 1 z; NP h ϕ2; f; NP p i 2 λϕ 2ϕ 1 admires ϕ 2; λfλc(z, fc); S NP p ϕ 1» admires some saxophonist; u : [(x : Ent) Sx] λc π 1u ; S 1 (c, u)) λϕ 1ϕ» 1 admires some saxophonist; u : [(x : Ent) Sx] λzλc π 1u ; S NP 1 (c, u)) every boy admires some» saxophonist; u : [(x : Ent) Sx] λc(v : [(x : Ent) Bx]) (π π 1u 1 ((c, v), u)) ; S Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 23 / 27

32 Simple sentence involving a quantifier (27) λϕλσσ(every boy); λqλc(v : [(x : Ent) Bx]) Q(π 1v)(c, v); S (S NP) λσσ(some» saxophonist); u : [(x : Ent) Sx] λqλc Q(λd@ π 1u 1 d)(c, u) S (S NP p) ; h ϕ1; i 1 z; NP h ϕ2; f; NP p i 2 λϕ 2ϕ 1 admires ϕ 2; λfλc(z, fc); S NP p ϕ 1» admires some saxophonist; u : [(x : Ent) Sx] λc π 1u ; S 1 (c, u)) λϕ 1ϕ» 1 admires some saxophonist; u : [(x : Ent) Sx] λzλc π 1u ; S NP 1 (c, u)) every boy admires some» saxophonist; u : [(x : Ent) Sx] λc(v : [(x : Ent) Bx]) (π π 1u ; S 1 ((c, v), u)) [ ] u : [(x : Ent) Sx] (28) λc(v : [(x : Ent) Bx]) (π 1v, π 1u) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 23 / 27

33 Geach sentences Subject wide scope: (29) every boy admires; λpλc(w : [(x : Ent) Bx]) P(λfλc(π 1 w, fc))(c, w); S/((S/NP p )\S) Object wide scope: (30) every girl detests; λpp(λfλc(w : [(x : Ent) Gx]) D(π 1 w, f(c, w))); S/((S/NP p )\S) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 24 / 27

34 Parallel scope is predicted to be good (31) Every boy admires, and every girl detests, some saxophonist Using the object wide scope version for both conjuncts, we obtain: (32) λc» w : [(x : Ent) Sx] t : (u : [(x : Ent) Bx]) (@ π 1w» 1 ((c, w), u)) s : [(x : Ent) Sx] (v : [(x : Ent) Gx]) D(@ π 1s 1 (((c, t), s), v)) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 25 / 27

35 Parallel scope is predicted to be good (31) Every boy admires, and every girl detests, some saxophonist Using the object wide scope version for both conjuncts, we obtain: (32) λc» w : [(x : Ent) Sx] t : (u : [(x : Ent) Bx]) (@ π 1w» 1 ((c, w), u)) s : [(x : Ent) Sx] (v : [(x : Ent) Gx]) D(@ π 1s 1 (((c, t), s), v)) 1 = λcπ 1 π 2 π 1 c, we obtain the right interpretation Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 25 / 27

36 Mixed scope is predicted to be bad Using the subject wide scope version for the first conjunct and the object wide scope version for the second conjunct, we obtain: (33) λc t :» u : [(x : Ent) Sx] (w : [(x : Ent) Bx]) (@ π 1u 1 ((c, w), u))» s : [(x : Ent) Sx] (v : [(x : Ent) Gx]) D(π 1v, (@ π 1s 1 (((c, t), s), v)) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 26 / 27

37 Mixed scope is predicted to be bad Using the subject wide scope version for the first conjunct and the object wide scope version for the second conjunct, we obtain: (33) λc t :» u : [(x : Ent) Sx] (w : [(x : Ent) Bx]) (@ π 1u 1 ((c, w), u))» s : [(x : Ent) Sx] (v : [(x : Ent) Gx]) D(π 1v, (@ π 1s 1 (((c, t), s), v)) first 1 = λcπ 1 π 2 c second 1 = λcπ 1 π 2 π 1 c This time, there is no coherent way of resolving 1 operator Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 26 / 27

38 Open questions Our analysis predicts that the object existential quantifier cannot scope widely within the second conjunct in the following sentence: (34) John admires, and every girl detests, some saxophonist (35) λc» u : [(x : Ent) Sx] t : π 1u» 1 (c, t)) s : [(x : Ent) Sx] (v : [(x : Ent) Gx]) D(π 1v, (@ π 1s 1 (((c, t), s), v)) Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 27 / 27

39 Open questions Our analysis predicts that the object existential quantifier cannot scope widely within the second conjunct in the following sentence: (34) John admires, and every girl detests, some saxophonist (35) λc» u : [(x : Ent) Sx] t : π 1u» 1 (c, t)) s : [(x : Ent) Sx] (v : [(x : Ent) Gx]) D(π 1v, (@ π 1s 1 (((c, t), s), v)) More generally, when different numbers of quantifiers are present in the two conjuncts, a parallel in-conjunct wide scope reading is blocked Is this a good prediction? (36) Every merican detests, and every Japanese has some serious reservations for, some Nobel Prize winner namely, their respective most recent Literature Prize winners Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 27 / 27

40 Bekki, D (2014) Representing anaphora with dependent types In sher, N and Soloviev, S, editors, Logical spects of Computational Linguistics 2014, pages 1429, Heidelberg Springer de Groote, P (2001) Towards abstract categorial grammars In ssociation for Computational Linguistics, 39th nnual Meeting and 10th Conference of the European Chapter, pages Geach, P T (1972) program for syntax In Davidson, D and Harman, G H, editors, Semantics of Natural Language, pages D Reidel, Dordrecht Hirshbühler, P (1982) VP deletion and across-the-board quantifier scope In Pustejovsky, J and Sells, P, editors, Proceedings of the Twelfth nnual Meeting of the North Eastern Linguistic Society, pages University of Massachusetts at mherst Muskens, R (2003) Language, lambdas, and logic In Kruijff, G-J and Oehrle, R, editors, Resource Sensitivity in Binding and naphora, pages 2354 Kluwer, Dordrecht Oehrle, R T (1994) Term-labeled categorial type systems Linguistics and Philosophy, 17(6): Steedman, M (2012) Taking Scope MIT Press, Cambridge, Mass Yusuke Kubota, Robert Levine Scope parallelism in coordination in DTS 27 / 27

Scope parallelism in coordination in Dependent Type Semantics

Scope parallelism in coordination in Dependent Type Semantics Scope parallelism in coordination in Dependent Type Semantics Yusuke Kubota 1 and Robert Levine 2 1 University of Tsukuba, Ohio State University 2 Ohio State University

More information

Two kinds of long-distance indefinites Bernhard Schwarz The University of Texas at Austin

Two kinds of long-distance indefinites Bernhard Schwarz The University of Texas at Austin Amsterdam Colloquium 2001, December 17-19, 2001 Two kinds of long-distance indefinites Bernhard Schwarz The University of Texas at Austin 1. Introduction Indefinites can often be interpreted as if they

More information

A Multi-Modal Combinatory Categorial Grammar. A MMCCG Analysis of Japanese Nonconstituent Clefting

A Multi-Modal Combinatory Categorial Grammar. A MMCCG Analysis of Japanese Nonconstituent Clefting A Multi-Modal Combinatory Categorial Grammar Analysis of Japanese Nonconstituent Clefting Department of Linguistics The Ohio State University {kubota,esmith}@ling.osu.edu A basic cleft sentence Data Clefting

More information

Semantics and Pragmatics of NLP The Semantics of Discourse: Overview

Semantics and Pragmatics of NLP The Semantics of Discourse: Overview university-logo Semantics and Pragmatics of NLP The Semantics of Discourse: Overview School of Informatics University of Edinburgh Outline university-logo 1 Anaphora across sentence boundaries 2 Changing

More information

A Weakness for Donkeys

A Weakness for Donkeys (1) Math Review A Weakness for Donkeys Carl Pollard Linguistics 794.14/812 April 21, 2011 Recall that if S, and P, are two preordered sets, then f : S P is called monotonic (antitonic) iff for all s, s

More information

Semantics and Pragmatics of NLP. SPNLP: Dynamic Semantics and Drawbacks

Semantics and Pragmatics of NLP. SPNLP: Dynamic Semantics and Drawbacks Semantics and Pragmatics of NLP Dynamic Semantics and Drawbacks School of Informatics University of Edinburgh Outline Some Quick Revision 1 Some Quick Revision 2 A quick overview of how DRSs are interpreted

More information

Semantics and Generative Grammar. Quantificational DPs, Part 2: Quantificational DPs in Non-Subject Position and Pronominal Binding 1

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

Linguistics 819: Seminar on TAG and CCG. Introduction to Combinatory Categorial Grammar

Linguistics 819: Seminar on TAG and CCG. Introduction to Combinatory Categorial Grammar Linguistics 819: Seminar on TAG and CCG Alexander Williams, 9 April 2008 Introduction to Combinatory Categorial Grammar Steedman and Dowty 1 The biggest picture Grammatical operations apply only to constituents.

More information

Semantics and Generative Grammar. Quantificational DPs, Part 3: Covert Movement vs. Type Shifting 1

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

E-type interpretation without E-type pronoun: How Peirce s Graphs. capture the uniqueness implication of donkey sentences

E-type interpretation without E-type pronoun: How Peirce s Graphs. capture the uniqueness implication of donkey sentences E-type interpretation without E-type pronoun: How Peirce s Graphs capture the uniqueness implication of donkey sentences Author: He Chuansheng (PhD student of linguistics) The Hong Kong Polytechnic University

More information

list readings of conjoined singular which -phrases

list 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 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

Continuations in Type Logical Grammar. Grafting Trees: (with Chris Barker, UCSD) NJPLS, 27 February Harvard University

Continuations in Type Logical Grammar. Grafting Trees: (with Chris Barker, UCSD) NJPLS, 27 February Harvard University Grafting Trees: Continuations in Type Logical Grammar Chung-chieh Shan Harvard University ccshan@post.harvard.edu (with Chris Barker, UCSD) NJPLS, 27 February 2004 Computational Linguistics 1 What a linguist

More information

An introduction to mildly context sensitive grammar formalisms. Combinatory Categorial Grammar

An introduction to mildly context sensitive grammar formalisms. Combinatory Categorial Grammar An introduction to mildly context sensitive grammar formalisms Combinatory Categorial Grammar Gerhard Jäger & Jens Michaelis University of Potsdam {jaeger,michael}@ling.uni-potsdam.de p.1 Basic Categorial

More information

Proseminar on Semantic Theory Fall 2010 Ling 720. The Basics of Plurals: Part 2 Distributivity and Indefinite Plurals

Proseminar on Semantic Theory Fall 2010 Ling 720. The Basics of Plurals: Part 2 Distributivity and Indefinite Plurals 1. Our Current Picture of Plurals The Basics of Plurals: Part 2 Distributivity and Indefinite Plurals At the conclusion of Part 1, we had built a semantics for plural NPs and DPs that had the following

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

564 Lecture 25 Nov. 23, Continuing note on presuppositional vs. nonpresuppositional dets.

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

a. Develop a fragment of English that contains quantificational NPs. b. Develop a translation base from that fragment to Politics+λ

a. Develop a fragment of English that contains quantificational NPs. b. Develop a translation base from that fragment to Politics+λ An Algebraic Approach to Quantification and Lambda Abstraction: Applications to the Analysis of English (1) Ingredients on the Table a. A logical language with both quantification and lambda abstraction

More information

Semantics and Generative Grammar. Pronouns and Variable Assignments 1. We ve seen that implicatures are crucially related to context.

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

LIN1032 Formal Foundations for Linguistics

LIN1032 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 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

Computational Semantics

Computational Semantics Computational Semantics Giving formalisms meaning Formal Representations Some logics: First Order Predicate Logic Lambda Caluclus Predicates, variables quantifiers Translating NL to LF Practical systems

More information

Donkey anaphora: Farmers and bishops

Donkey anaphora: Farmers and bishops Donkey anaphora: Farmers and bishops Adrian Brasoveanu, Jakub Dotlačil June 19, 2018 Contents 1 Introduction: First Order Logic (FOL) and pronouns 1 2 Problems for a compositional semantics based on classical

More information

Weak Familiarity and Anaphoric Accessibility in Dynamic Semantics

Weak Familiarity and Anaphoric Accessibility in Dynamic Semantics Weak Familiarity and Anaphoric Accessibility in Dynamic Semantics Scott Martin Department of Linguistics Ohio State University Columbus, Ohio 43210 USA http://www.ling.ohio-state.edu/~scott/ Abstract.

More information

Semantics I, Rutgers University Week 3-1 Yimei Xiang September 17, Predicate logic

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

06 From Propositional to Predicate Logic

06 From Propositional to Predicate Logic Martin Henz February 19, 2014 Generated on Wednesday 19 th February, 2014, 09:48 1 Syntax of Predicate Logic 2 3 4 5 6 Need for Richer Language Predicates Variables Functions 1 Syntax of Predicate Logic

More information

Exceptional Wide Scope as Anaphora to Quantificational Dependencies

Exceptional Wide Scope as Anaphora to Quantificational Dependencies Exceptional Wide Scope as Anaphora to Quantificational Dependencies Adrian Brasoveanu* *Stanford University Donka F. Farkas** **University of California at Santa Cruz Abstract The paper proposes a novel

More information

Introduction to Semantics. Pronouns and Variable Assignments. We ve seen that implicatures are crucially related to context.

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

Presupposition and Montague Grammar (Krahmer 1998, Ch. 5)

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

Ling 98a: The Meaning of Negation (Week 5)

Ling 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 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

The Semantics of Questions Introductory remarks

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

Modal subordination is neither modal nor subordinate...discuss

Modal subordination is neither modal nor subordinate...discuss Modal subordination is neither modal nor subordinate...discuss Scott AnderBois November 23, 2008 1 Introduction We have seen in numerous other works that indefinites introduce discourse referents that

More information

Composing questions: A hybrid categorial approach

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

Sharpening the empirical claims of generative syntax through formalization

Sharpening the empirical claims of generative syntax through formalization Sharpening the empirical claims of generative syntax through formalization Tim Hunter University of Minnesota, Twin Cities NASSLLI, June 2014 Part 1: Grammars and cognitive hypotheses What is a grammar?

More information

473 Topics. Knowledge Representation III First-Order Logic. Logic-Based KR. Propositional. Logic vs. First Order

473 Topics. Knowledge Representation III First-Order Logic. Logic-Based KR. Propositional. Logic vs. First Order 473 Topics Knowledge Representation III First-Order Logic CSE 473 Perception NLP Robotics Multi-agent Inference Logic Supervised Learning Knowledge Representation Search Problem Spaces Agency Reinforcement

More information

CS 730/730W/830: Intro AI

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

NP Coordination in Underspecified Scope Representations

NP Coordination in Underspecified Scope Representations NP Coordination in Underspecified Scope Representations Alistair Willis The Open University Milton Keynes, UK. A.G.Willis@open.ac.uk Abstract Accurately capturing the quantifier scope behaviour of coordinated

More information

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

More information

Presuppositions (introductory comments)

Presuppositions (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 information

Proseminar on Semantic Theory Fall 2013 Ling 720 An Algebraic Approach to Quantification and Lambda Abstraction: Fregean Interpretations 1

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

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

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

Propositional Logic Not Enough

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

Lambek Grammars as Combinatory Categorial Grammars

Lambek Grammars as Combinatory Categorial Grammars Lambek Grammars as Combinatory Categorial Grammars GERHARD JÄGER, Zentrum für Allgemeine Sprachwissenschaft (ZAS), Jägerstr 10/11, 10117 Berlin, Germany E-mail: jaeger@zasgwz-berlinde Abstract We propose

More information

Two sets of alternatives for numerals

Two 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 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

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

More information

Dynamic Interpretations and Interpretation Structures

Dynamic Interpretations and Interpretation Structures Dynamic Interpretations and Interpretation Structures Yasuo Nakayama Graduate School of Human Sciences, Osaka University, Japan 1 Introduction Dynamic semantics has its roots in the research of anaphoric

More information

Hyperintensional Dynamic Semantics

Hyperintensional Dynamic Semantics Hyperintensional Dynamic Semantics Analyzing Definiteness with Enriched Contexts Scott Martin and Carl Pollard Department of Linguistics Ohio State University Columbus, OH 43210 USA {scott,pollard}@ling.ohio-state.edu

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

Proseminar on Semantic Theory Fall 2013 Ling 720 The Proper Treatment of Quantification in Ordinary English, Part 1: The Fragment of English

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

SYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES

SYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES SYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES Singular Sentences name Paris is beautiful (monadic) predicate (monadic) predicate letter Bp individual constant Singular Sentences Bp These are our new simple

More information

Introduction to Semantic Parsing with CCG

Introduction to Semantic Parsing with CCG Introduction to Semantic Parsing with CCG Kilian Evang Heinrich-Heine-Universität Düsseldorf 2018-04-24 Table of contents 1 Introduction to CCG Categorial Grammar (CG) Combinatory Categorial Grammar (CCG)

More information

CS 730/830: Intro AI. 3 handouts: slides, asst 6, asst 7. Wheeler Ruml (UNH) Lecture 12, CS / 16. Reasoning.

CS 730/830: Intro AI. 3 handouts: slides, asst 6, asst 7. Wheeler Ruml (UNH) Lecture 12, CS / 16. Reasoning. CS 730/830: Intro AI 3 handouts: slides, asst 6, asst 7 Wheeler Ruml (UNH) Lecture 12, CS 730 1 / 16 Logic First-Order Logic The Joy of Power in First-order Logic Wheeler Ruml (UNH) Lecture 12, CS 730

More information

Sum Individuals and Proportion Problem

Sum Individuals and Proportion Problem Sum Individuals and Proportion Problem Y oungeun Y oon This paper proposes that the so-called proportion problem, which was observed in Kadmon (1987, 1990) as a problem to the analyses of Kamp (1981) and

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

Monadic dynamic semantics for anaphora

Monadic dynamic semantics for anaphora Monadic dynamic semantics for anaphora Simon Charlow Rutgers, The State University of New Jersey OSU Dynamics Workshop October 24, 2015 1 Goals for today I ll sketch a monadic dynamic semantics for discourse

More information

Syntax Semantics Tableau Completeness Free Logic The Adequacy of First-Order Logic. Predicate Logic. Daniel Bonevac.

Syntax Semantics Tableau Completeness Free Logic The Adequacy of First-Order Logic. Predicate Logic. Daniel Bonevac. March 18, 2013 Aristotle s theory of syllogisms, the first real logical theory, took predicates expressions that are not true or false in themselves, but true or false of objects as its basic units of

More information

Semantics and Generative Grammar. Formal Foundations: A Basic Review of Sets and Functions 1

Semantics and Generative Grammar. Formal Foundations: A Basic Review of Sets and Functions 1 Formal Foundations: A Basic Review of Sets and Functions 1 1. Naïve Set Theory 1.1 Basic Properties of Sets A set is a group of objects. Any group of objects a, b, c forms a set. (1) Representation of

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

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

INTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4

INTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4 INTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4 Neil D. Jones DIKU 2005 Some slides today new, some based on logic 2004 (Nils Andersen), some based on kernebegreber (NJ 2005) PREDICATE LOGIC:

More information

Monadic dynamic semantics: Side effects and scope

Monadic dynamic semantics: Side effects and scope Monadic dynamic semantics: Side effects and scope Simon Charlow 1 Dylan Bumford 2 1 Rutgers University 2 New York University Fourth Workshop on Natural Language and Computer Science July 10, 2016 1 Overview

More information

Adverbial Quantifiers, Maximal Situations, and Weak E-type Pronouns * Toshiyuki Ogihara University of Washington

Adverbial Quantifiers, Maximal Situations, and Weak E-type Pronouns * Toshiyuki Ogihara University of Washington Adverbial Quantifiers, Maximal Situations, and Weak E-type Pronouns * Toshiyuki Ogihara University of Washington Abstract This paper argues with von Fintel (1994) and others that adverbs of quantification

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

Math 3320 Foundations of Mathematics

Math 3320 Foundations of Mathematics Math 3320 Foundations of Mathematics Chapter 1: Fundamentals Jesse Crawford Department of Mathematics Tarleton State University (Tarleton State University) Chapter 1 1 / 55 Outline 1 Section 1.1: Why Study

More information

Hardegree, Formal Semantics, Handout of 8

Hardegree, Formal Semantics, Handout of 8 Hardegree, Formal Semantics, Handout 2015-04-07 1 of 8 1. Bound Pronouns Consider the following example. every man's mother respects him In addition to the usual demonstrative reading of he, x { Mx R[m(x),

More information

QUANTIFICATIONAL READINGS OF INDEFINITES

QUANTIFICATIONAL READINGS OF INDEFINITES QUANTIFICATIONAL READINGS OF INDEFINITES WITH FOCUSED CREATION VERBS * Tamina Stephenson, Massachusetts Institute of Technology tamina@mit.edu Abstract This paper looks at sentences with quantificational

More information

Exhaustively as Cell Identification

Exhaustively as Cell Identification Danny Fox Page 1 UMass Linguistics Colloquium Exhaustively as Cell Identification Dayal s (1996) approach to question presupposition: a. Accounts for existence and uniqueness presuppositions. b. Accounts

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

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

Proseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1

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

Decision Procedures for Satisfiability and Validity in Propositional Logic

Decision Procedures for Satisfiability and Validity in Propositional Logic Decision Procedures for Satisfiability and Validity in Propositional Logic Meghdad Ghari Institute for Research in Fundamental Sciences (IPM) School of Mathematics-Isfahan Branch Logic Group http://math.ipm.ac.ir/isfahan/logic-group.htm

More information

A proof theoretical account of polarity items and monotonic inference.

A proof theoretical account of polarity items and monotonic inference. A proof theoretical account of polarity items and monotonic inference. Raffaella Bernardi UiL OTS, University of Utrecht e-mail: Raffaella.Bernardi@let.uu.nl Url: http://www.let.uu.nl/ Raffaella.Bernardi/personal

More information

Logic. Stephen G. Ware CSCI 4525 / 5525

Logic. Stephen G. Ware CSCI 4525 / 5525 Logic Stephen G. Ware CSCI 4525 / 5525 Logic How can we represent knowledge about the world in a general, reusable way? How can we use existing knowledge to gain new knowledge? Problem Solving Approaches

More information

2 Higginbotham & May s proposal

2 Higginbotham & May s proposal A Generalized Definition of Quantifier Absorption Nissim Francez Technion, Haifa Yoad Winter OTS, Utrecht University 1 Introduction In most artificial logical languages with quantifier operators variable

More information

CSC384: Intro to Artificial Intelligence Knowledge Representation II. Required Readings: 9.1, 9.2, and 9.5 Announcements:

CSC384: Intro to Artificial Intelligence Knowledge Representation II. Required Readings: 9.1, 9.2, and 9.5 Announcements: CSC384: Intro to Artificial Intelligence Knowledge Representation II Required Readings: 9.1, 9.2, and 9.5 Announcements: 1 Models Examples. Environment A Language (Syntax) Constants: a,b,c,e Functions:

More information

GS03/4023: Validation and Verification Predicate Logic Jonathan P. Bowen Anthony Hall

GS03/4023: Validation and Verification Predicate Logic Jonathan P. Bowen   Anthony Hall GS03/4023: Validation and Verification Predicate Logic Jonathan P. Bowen www.cs.ucl.ac.uk/staff/j.bowen/gs03 Anthony Hall GS03 W1 L3 Predicate Logic 12 January 2007 1 Overview The need for extra structure

More information

Lecture 5: Semantic Parsing, CCGs, and Structured Classification

Lecture 5: Semantic Parsing, CCGs, and Structured Classification Lecture 5: Semantic Parsing, CCGs, and Structured Classification Kyle Richardson kyle@ims.uni-stuttgart.de May 12, 2016 Lecture Plan paper: Zettlemoyer and Collins (2012) general topics: (P)CCGs, compositional

More information

Intelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.

Intelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19. Intelligent Agents First Order Logic Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University last change: 19. Mai 2015 U. Schmid (CogSys) Intelligent Agents last change: 19. Mai 2015

More information

Hamblin Semantics & Focus

Hamblin Semantics & Focus 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

More information

Towards Tractable Inference for Resource-Bounded Agents

Towards Tractable Inference for Resource-Bounded Agents Towards Tractable Inference for Resource-Bounded Agents Toryn Q. Klassen Sheila A. McIlraith Hector J. Levesque Department of Computer Science University of Toronto Toronto, Ontario, Canada {toryn,sheila,hector}@cs.toronto.edu

More information

Introduction to first-order logic:

Introduction to first-order logic: Introduction to first-order logic: First-order structures and languages. Terms and formulae in first-order logic. Interpretations, truth, validity, and satisfaction. Valentin Goranko DTU Informatics September

More information

Propositional Logic: Part II - Syntax & Proofs 0-0

Propositional Logic: Part II - Syntax & Proofs 0-0 Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems

More information

2. Use quantifiers to express the associative law for multiplication of real numbers.

2. Use quantifiers to express the associative law for multiplication of real numbers. 1. Define statement function of one variable. When it will become a statement? Statement function is an expression containing symbols and an individual variable. It becomes a statement when the variable

More information

Discrete Mathematics and Its Applications

Discrete Mathematics and Its Applications Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical

More information

Logic. Lesson 3: Tables and Models. Flavio Zelazek. October 22, 2014

Logic. Lesson 3: Tables and Models. Flavio Zelazek. October 22, 2014 Logic Lesson 3: Tables and Models Flavio Zelazek flavio.zelazek@gmail.com October 22, 2014 Flavio Zelazek (flavio.zelazek@gmail.com) Logic (Lesson 3: Tables and Models) October 22, 2014 1 / 29 Previous

More information

Spring 2018 Ling 620 Introduction to Semantics of Questions: Questions as Sets of Propositions (Hamblin 1973, Karttunen 1977)

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

Notes on a situation-free fragment for donkey anaphora Chris Barker, NYU, homepages.nyu.edu/ cb125 Introduction. These notes were produced at the

Notes on a situation-free fragment for donkey anaphora Chris Barker, NYU, homepages.nyu.edu/ cb125 Introduction. These notes were produced at the Notes on a situation-free fragment for donke anaphora Chris Barker, NYU, homepages.nu.edu/ cb125 Introduction. These notes were produced at the request of Chris Kenned, for the purpose of providing something

More information

Categorial Grammar and Discourse Representation Theory

Categorial Grammar and Discourse Representation Theory Categorial Grammar and Discourse Representation Theory Reinhard Muskens Abstract In this paper it is shown how simple texts that can be parsed in a Lambek Categorial Grammar can also automatically be provided

More information

Propositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel

Propositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel Propositional Logic Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/

More information

Gender in conditionals

Gender in conditionals Gender in conditionals Fabio Del Prete 1 Sandro Zucchi 2 1 CLLE-ERSS (CNRS, Toulouse), 2 Università degli Studi di Milano 9 November 2017 The University of Sheffield, Department of Philosophy Indexical

More information

The Lambda Calculus. Stephen A. Edwards. Fall Columbia University

The Lambda Calculus. Stephen A. Edwards. Fall Columbia University The Lambda Calculus Stephen A. Edwards Columbia University Fall 2014 Lambda Expressions Function application written in prefix form. Add four and five is (+ 4 5) Evaluation: select a redex and evaluate

More information

Propositions and Proofs

Propositions and Proofs Propositions and Proofs Gert Smolka, Saarland University April 25, 2018 Proposition are logical statements whose truth or falsity can be established with proofs. Coq s type theory provides us with a language

More information

Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2014

Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2014 Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2014 Class #23 - Translation into Predicate Logic II ( 3.2) Only as a Quantifier P Only Ps are Qs is logically equivalent to all Qs are

More information

Grundlagenmodul Semantik All Exercises

Grundlagenmodul Semantik All Exercises Grundlagenmodul Semantik All Exercises Sommersemester 2014 Exercise 1 Are the following statements correct? Justify your answers in a single short sentence. 1. 11 {x x is a square number} 2. 11 {x {y y

More information

1. The Semantic Enterprise. 2. Semantic Values Intensions and Extensions. 3. Situations

1. The Semantic Enterprise. 2. Semantic Values Intensions and Extensions. 3. Situations Hardegree, Formal Semantics, Handout, 2015-02-03 1 of 8 1. The Semantic Enterprise The semantic-analysis of a phrase φ consists in the following. (1) providing a semantic-value for φ, and each of its component

More information

Semantics and Pragmatics of NLP Pronouns

Semantics and Pragmatics of NLP Pronouns Semantics and Pragmatics of NLP Pronouns School of Informatics University of Edinburgh Outline Observations About Data 1 Observations of what factors influence the way pronouns get resolved 2 Some algorithms

More information

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element

More information

Outline First-order logic. First-order Logic. Introduction. Recall: 4-Queens problem. First-order Logic. First-order Logic Syntax.

Outline First-order logic. First-order Logic. Introduction. Recall: 4-Queens problem. First-order Logic. First-order Logic Syntax. First-order Logic CS 486/686 Sept 25, 2008 University of Waterloo Outline First-order logic Syntax and semantics Inference Propositionalization with ground inference Lifted resolution 1 2 Introduction

More information