The Semantics of R¯ A: Let’s be more specific!
Masoud Jasbi Stanford University
1
The Semantics of R A: Lets be more specific! Masoud Jasbi - - PowerPoint PPT Presentation
The Semantics of R A: Lets be more specific! Masoud Jasbi Stanford University 1 Snapshot Definiteness = existence presup + uniqueness presup. 2 Snapshot Definiteness = existence presup + uniqueness presup. In Farsi, R a
1
2
2
2
2
(Karimi, 1990)
(Mahootian, 1997), among others
(Dabir-Moghaddam, 1992; Dalrymple and Nikolaeva, 2011)
(Shokouhi and Kipka, 2003)
(Karimi, 1999, 2003)
(Ghomeshi, 1996) 3
4
4
4
4
4
4
4
5
6
6
(Stalnaker, 1978) 6
(Stalnaker, 1978)
6
7
8
(Russell, 1905; Strawson, 1950) 8
(Russell, 1905; Strawson, 1950)
8
9
10
10
11
12
(Fodor and Sag, 1982)
12
(Fodor and Sag, 1982)
12
13
Context: My three-year-old cousin takes my phone and accidentally deletes a picture. I see that my pics are 99 instead of 100 but I don’t know which picture is deleted:
NEG-MI-know-1.SG
13
Context: There are some plates on the table.
ID
14
15
ID
15
16
Context: Dance Class; Equal number of girls and boys. Boys have to choose partners.
ID
16
Context: Maryam has three job offers. She has to pick one by tomorrow.
MI-want3.SG
ID
NEG-MI-know-3.SG
17
Context: A Boring Restaurant where everyone always orders burgers. The waiter says:
ID
18
Context: Dance Class.
ID
19
20
21
22
MI-see-3.SG
ID
MI-see-3.SG
22
MI-see-3.SG
ID
MI-see-3.SG
22
23
MI-see-3.SG
ID
MI-see-3.SG
23
MI-see-3.SG
ID
MI-see-3.SG
23
MI-see-3.SG
ID
MI-see-3.SG
23
MI-see-3.SG
ID
MI-see-3.SG
23
24
25
26
ID
MI-see-3.SG
ID
MI-see-3.SG
26
27
ID
MI-see-3.SG
ID
MI-see-3.SG
27
ID
MI-see-3.SG
ID
MI-see-3.SG
27
28
NEG-have.PST
NEG-give.PST.3SG
28
NEG-have.PST
NEG-give.3SG
29
NEG-give.3SG
30
MI-know-2SG
MI-know-2SG
31
32
33
t
et
⟨e,et⟩
e
et
⟨et,et⟩
et
iota
e
34
⟨et,t⟩
et
⟨et,et⟩
et
⟨et,⟨et,t⟩⟩
35
λxλy[eat(x)(y)]
⟨e,et⟩
xordam λQ[∃x[∂[∣pear∣ ≥ 1] ∧ pear(x) ∧ Q(x)]]
⟨et,t⟩
λx[∂[∣pear∣ ≥ 1] ∧ pear(x)]
et
λP[λx[∂[∣P∣ ≥ 1] ∧ P(x)]]
⟨et,et⟩
ro
et
gol¯ abi λPλQ[∃x[P(x) ∧ Q(x)]]
⟨et,⟨et,t⟩⟩
ye 36
∃x[∂[∣pear∣ ≥ 1] ∧ pear(x) ∧ eat(x)(sp)(x)] t λt[eat(t)(sp)] et eat(t)(sp) t λy[eat(t)(y)] et λxλy[eat(x)(y)] ⟨e,et⟩
xordam
t e sp e
man
λt λQ[∃x[∂[∣pear∣ ≥ 1] ∧ pear(x) ∧ Q(x)]] ⟨et,t⟩ λx[∂[∣pear∣ ≥ 1] ∧ pear(x)] et λP[λx[∂[∣P∣ ≥ 1] ∧ P(x)]] ⟨et,et⟩
ro
pear et
gol¯ abi
λPλQ[∃x[P(x) ∧ Q(x)]] ⟨et,⟨et,t⟩⟩
ye 37
38
39
ID
40
41