summaryrefslogtreecommitdiff
path: root/ling/semantics.md
blob: 23d873dd994c074e1eb992df96f36b7bd84a63d7 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
---
layout: linguistics
title: linguistics/semantics
---

# semantics and pragmatics

Semantics is the study of **meaning**.

How do we know what sentences are *true* and which are *false*?<br>
What does it *mean* for a sentence to be true?<br>
What *conditions* must hold for a sentence to be true?

<details>
<summary><b>Table of Contents</b></summary>

- History
- Prerequisites
- Basic Principles
  - [Compositionality](#compositionality)
  - [Substitution](#substitution)
  - [Higher-Order Logic & The Lambda Calculus](#higher-order-logic-the-lambda-calculus)
  - [Types](#types)
  - Models
- Denotational Semantics
  - Entities and Functions
  - Quantification
  - Negation
  - Coordination
  - Reference
  - Numbers and Plurality
  - Event and Situation Semantics
- Possible Worlds
  - Necessity and Possibility
  - Knowledge and Belief
  - Command, Request, and Obligation
  - Drawing Distinctions
  - Tense and Aspect
- Beyond Truth
  - Intuitionistic Logic
  - Questions
  - Utterances
- Pragmatics
  - Impliciture
  - Presupposition
  - Performative Acts
- Lexical Semantics

</details>


## History

> the dirty secret of semantics is that 2/3rds of it was created by philosophers\
> and the remaining third is angelika kratzer
>
> -- partialorder

Modern approaches to semantics largely fell out of historical work in logic...
- c.i. lewis
- paul grice
- richard montague
- irene heim
- angelika kratzer
- judith butler
- ...

## Prerequisites

Formal semantics builds atop a bevy of concepts in formal logic.
Comfortability with the following concepts will be assumed:
- object languages and meta languages
- propositional / zeroth-order logic
- predicate / first-order logic
- the lambda calculus
- simple types
- logical models
- modal logic
  - possible worlds
  - accessibility relations
- higher-order logic
- intuitionistic logic

If this is not the case, there are a variety of wonderful resources for learning such topics. I am partial to [*An Introduction to Non-Standard Logics*](https://annas-archive.org/md5/21cdfde7ee1a125c1bfe6d03d4541970) myself, and think it gives a good, operational, syntactic motivation for possible worlds and accessibility relations. I have heard much praise for [*Boxes and Diamonds*](https://bd.openlogicproject.org/) (which is free and open!) but have yet to read it myself. Wikipedia is also a wonderful reference. Best of all, however, is finding yourself a friend who is a nerd about logic!

These notes chart a standard course through undergraduate/graduate semantics that is taken by the canonical texts: [*Semantics in Generative Grammar*](https://annas-archive.org/md5/2d9c2174690df454700fedcd4a9b237c) and [*Invitation to Formal Semantics*](https://eecoppock.info/bootcamp/semantics-boot-camp.pdf) at the undergraduate level, and [*Intensional Semantics*](https://web.mit.edu/fintel/fintel-heim-intensional.pdf) ([source](https://github.com/fintelkai/fintel-heim-intensional-notes)) and [*Logic, Language, and Meaning*](https://annas-archive.org/md5/359c3ff1e391376cb2ac110c4e8a8d71) at the graduate level. I strongly recommend *Invitation to Formal Semantics* for those experienced in and new to logic alike. The beginning chapters give a comfortable introduction to predicate logic and the lambda calculus, which can be skipped easily by those already well versed in formalism.

$$∧ ∨ + × ⊕ ↑ ↓ ∼ ¬ ⇁ → ⇒ ⊃ ⊐ ⥽ > ⊢ ⊨$$

## Basic Principles

### Compositionality

The *Principle of Compositionality* states that the meaning of a *constituent* is determined **entirely** by its *components*. This is *the* fundamental underlying principle behind formal logic and subsequently semantics. It holds for not just sentence composition (syntax), but also *word formation* (morphology), and what is of interest to us here - meaning (semantics).

This is important, and not entirely obvious - given how much *context* is wrapped up in everyday speech, it might seem like a bit of a stretch to claim that ex. the meaning of a sentence is contained entirely within its parts. And, in many regards, it is. But we must start somewhere. We will address the problem of context when we come to it, but as a sneak peek: we typically consider sentences (and expressions as a whole) with respect to a *model*, which can contain broader context (among other things). In other (more [PLT](/plt)-y) words, we *parametrize* our sentences across domains.

### Substitution

The *Principle of Substitution* states that substituting one part of an expression with something else of the same meaning *preserves* the meaning of the expression as a whole. This may typically be thought of as a given, but semantics has its roots in philosophy, and philosophers care very much about enumerating their givens. And there are cases in which it is not only not a given, but does not hold entirely! We shall highlight such cases as we come to them.

...

### Higher-Order Logic & The Lambda Calculus

Formal semantics attempts to answer those questions by providing a *framework* for determining what conditions must hold for a sentence to be true. This framework can be thought of as a meta-language (c.f. meta/object language distinction) for all natural language: a language in which to *describe meaning*.

This language is [higher-order logic](../math/logic) and the [simply-typed lambda calculus](../plt/lambda-calculus). On top of this, we often build set theory, relying on *characteristic functions* of the lambda calculus as denotations of *set membership*. While we could in principle use natural language as our framework - and historically, this has been the case - formal semantics begets a formal system for such semantics. And a formal system has a number of advantages - an unambiguous presentation, cross-linguistic accessibility, computational interpretations... semantics is the study of meaning, and what is logic but a system for expressing meaning?

Our logic needs to be higher-order as natural language has the need to quantify over quite a lot of constructions. Propositional (zeroth-order) logic is too weak, as we may not quantify over any entities. Predicate (first-order logic) is still too weak as while we may quantify over entities, we have no way to quantify over propositions. Thus we need at least second-order logic - which, interestingly enough, is equivalent to any higher nth-order logic (and so is typically just called higher-order logic).

[*An Invitation to Formal Semantics*](https://eecoppock.info/bootcamp/semantics-boot-camp.pdf) covers basic logic and the lambda calculus well in its first six chapters. Otherwise, for a worse introduction, see [my notes on logic](../math/logic) and [the lambda calculus](../plt/lambda-calculus).

$$λ\ ∀\ ∃\ ι\ ∂\ ☐\ ◇$$

### Types

Formal semantics has a rather minimal notion of types. To quote *Intensional Semantics*:

> 1. $e$ and $t$ (entities and truth values) are semantic types.
> 2. If $σ$ and $τ$ are semantic types, then $⟨σ,τ⟩$ is a semantic type.
> 3. If $σ$ is a semantic type, then $⟨s,σ⟩$ is a semantic type.
> 4. Nothing else is a semantic type.

The semantic product type $⟨σ,τ⟩$ is more similar in usage to the function type $σ → τ$ from programming language theory. Nonetheless, $⟨σ,τ⟩$ is convention. It is fairly common to write such basic types as $στ$ for compactness, though this will be avoided in these notes for explicitness.

The notion of *entities* is not necessarily straightforward... We shall consider our truth values to be taken from the classical set $\{0,1\}$ unless otherwise specified.

We also, on occasion, consider the types of *situations* and *events*...

$$e\ t\ ⟨σ,τ⟩\ ⟨s,σ⟩$$

### Models

## Denotational Semantics

With basic logic and $λ→$ under our belt, we may get straight to assigning *meaning* to language.

### Entities and Functions

> *I am Alice.* <br>
> *Alice is pretty.* <br>
> *The blue bird flew away.*

How do we even begin to represent basic sentences?

Let's start with something a little simpler.

> *Alice.*

We consider *Alice* to be an *entity*.
- $⟦\text{Alice}⟧^M ↝ Alice_e$

- $⟦\text{Alice is pretty}⟧^M$
  - $⟦\text{Alice}⟧^M = \text{Alice}_e$
  - $⟦\text{pretty}⟧^M = \text{pretty} ↝ λx_e \text{pretty}(x)$
- $⟦\text{Alice is pretty}⟧^M ↝ \text{pretty}(\text{Alice}_e)$


### Quantification

> *Every bug saw Alice.* \
> *No bug saw Alice.* \

How might we represent sentences that involve *quantification*?

As it turns out, we must extend our formal system.

- $\text{every} ↝ λQ_{⟨e,t⟩} λP_{⟨e,t⟩} ∀x [P(x) → Q(x)]$
  - $\text{everything} ↝ λP_{⟨e,t⟩} ∀x P(x)$
- $\text{some} ↝ λQ_{⟨e,t⟩} λP_{⟨e,t⟩} ∃x [P(x) ∧ Q(x)]$
  - $\text{something} ↝ λP_{⟨e,t⟩} ∃x P(x)$
- $\text{no} ↝ λQ_{⟨e,t⟩} λP_{⟨e,t⟩} ∀x [P(x) → ¬Q(x)]$
  - $↝ λQ_{⟨e,t⟩} λP_{⟨e,t⟩} ∀x [¬P(x) ∨ ¬Q(x)]$
  - $↝ λQ_{⟨e,t⟩} λP_{⟨e,t⟩} ¬∃x [P(x) ∧ Q(x)]$
- $\text{nothing} ↝ λP_{⟨e,t⟩} ¬∃x P(x) ↝ λP_{⟨e,t⟩} ∀x ¬P(x)$
- "except": ↝
- "many": ↝
- "three": ↝
- "most": ↝
- "few": ↝
### Negation
- not: ↝ $λP_{⟨e,t⟩} λx_e.¬P(x)$

### Coordination

talk abt generics

clausal coordination:
- $\text{or}_C ↝ λq_t λp_t [p ∨ q]$
- $\text{and}_C ↝ λq_t λp_t [p ∧ q]$

verbal coordination:
- $\text{or}_V ↝ λQ_{⟨e,t⟩} λP_{⟨e,t⟩} λx_e [P(x) ∨ Q(x)]$
- $\text{and}_V ↝ λQ_{⟨e,t⟩} λP_{⟨e,t⟩} λx_e [P(x) ∧ Q(x)]$

quantifier coordination:
- $\text{or}_Q ↝ λQ_{⟨e,⟨e,t⟩⟩} λP_{⟨e,⟨e,t⟩⟩} λy_e λx_e [P(x,y) ∨ Q(x,y)]$
- $\text{and}_Q ↝ λQ_{⟨e,⟨e,t⟩⟩} λP_{⟨e,⟨e,t⟩⟩} λy_e λx_e [P(x,y) ∧ Q(x,y)]$

### Reference

co-indexation

### Numbers and Plurality

having a quantity function

### Event and Situation Semantics

what are these??

## Possible Worlds


### Necessity and Possibility

> *Alice may run.*  \
> *Alice must run.* \
> *Alice should run.* \
> *Alice could run.*

### Knowledge and Belief

### Command, Request, Obligation

> *Alice, run!* <br>
> *Alice, please run.* <br>
> *Alice should run.*

### Strength and Flavour

### Drawing Distinctions

### Accessibility Relations

- $ρ$ reflexivity
  - $∀x : x∼x$
- $σ$ symmetry
  - $∀x,y : x∼y ⇒ y∼x$
- $τ$ transitivity
  - $∀x,y,z : x∼y ∧ y∼z ⇒ x∼z$
- $η$ extensionality
  - $∀x, ∃y : x∼y$

when do you have these accessibility relations?

### Propositions and Worlds

To quote Kratzer:
- A proposition $p$ is *true* in a world $w ∈ W$ iff $w ∈ p$.
- A proposition $p$ *follows* from a set of propositions $P$ iff $p ⊆ ⋂P$.
- A set of propositions $P$ is *consistent* iff $⋂P ≠ ∅$.
- A proposition $p$ is *compatible with* a set of propositions $P$ iff $P∪\{p\}$ is consistent.

### Conversational Backgrounds

## Beyond Truth

So far, we have only dealt with sentences that can be, for some notion of truth, considered *true* or *false*.

### Questions

> *Did Alice run?*

### Tense and Aspect

> *Alice ran.* \
> *Alice runs.* \
> *Alice will run.* \