--- 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*?
What does it *mean* for a sentence to be true?
What *conditions* must hold for a sentence to be true?
Table of Contents - History - Prerequisites - Basic Principles - [Compositionality](#compositionality) - [Substitution](#substitution) - [Higher-Order Logic & The Lambda Calculus](#higher-order-logic-the-lambda-calculus) - Models and Denotation - Denotational Semantics - Entities and Functions - Quantification - Reference - Numbers and Plurality - Event Semantics - 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
## 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* myself, and think it gives a good, operational, syntactic motivation for possible worlds and accessibility relations. I have heard praise for *Boxes and Diamonds* (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! (thanks alex) These notes chart a standard course through undergraduate/graduate semantics that is taken by the canonical texts: *Semantics in Generative Grammar* and *Invitation to Formal Semantics* at the undergraduate level, and *Intensional Semantics* and *Logic, Language, and Meaning* 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*... ## Denotational Semantics With basic logic and the lambda calculus under our belt, we may simply get straight to assigning *meaning* to language. We consider two *basic types* to start: the type of entities, $e$, and the type of truth values, $t$. Our function types we denote by ordered pairs: that is, a function from $e$ to $t$ is of type $⟨e,t⟩$. This is perhaps clunkier notation than the type-theoretic $e→t$, but it is what it is. (And does avoid issues of precedence.) ### Entities and Functions > *I am Alice.*
> *Alice is pretty.*
> *The blue pigeon flew away.* - Noun: $⟨e,t⟩ ↝ λx.Noun(x)$ - Verb (intransitive): $⟨e,t⟩ ↝ λx.Verb(x)$ - Verb (transitive): $⟨e,⟨e,t⟩⟩ ↝ λy.λx.Verb(x, y)$ - Verb (meaningless): $⟨⟨e,t⟩,⟨e,t⟩⟩ ↝ λP.λx.P(x)$ - Adj: $⟨⟨e,t⟩,⟨e,t⟩⟩ ↝ λNoun.λx.[Adj(x) ∧ Noun(x)]$ - or (clausal): $⟨t,⟨t,t⟩⟩ ↝ λq.λp.[p ∨ q]$ - and (clausal): $⟨t,⟨t,t⟩⟩ ↝ λq.λp.[p ∧ q]$ - or (verbal): $⟨⟨e,t⟩,⟨⟨e,t⟩,⟨e,t⟩⟩⟩ ↝ λQ.λP.λx.[P(x) ∨ Q(x)]$ - and (verbal): $⟨⟨e,t⟩,⟨⟨e,t⟩,⟨e,t⟩⟩⟩ ↝ λQ.λP.λx.[P(x) ∧ Q(x)]$ - or (quantifiers): $⟨⟨e,⟨e,t⟩⟩,⟨⟨e,⟨e,t⟩⟩,⟨e,⟨e,t⟩⟩⟩⟩ ↝ λQ.λP.λy.λx.[P(x,y) ∨ Q(x,y)]$ - and (quantifiers): $⟨⟨e,⟨e,t⟩⟩,⟨⟨e,⟨e,t⟩⟩,⟨e,⟨e,t⟩⟩⟩⟩ ↝ λQ.λP.λy.λx.[P(x,y) ∧ Q(x,y)]$ - not: $⟨⟨e,t⟩,⟨e,t⟩⟩ ↝ λP.λx.¬P(x)$ ### Quantification - every: $⟨⟨e,t⟩,⟨⟨e,t⟩,t⟩⟩ ↝ λQ.λP.∀x.[P(x) → Q(x)]$ - everything: $⟨⟨e,t⟩,t⟩ ↝ λP.∀x.P(x)$ - some: $⟨⟨e,t⟩,⟨⟨e,t⟩,t⟩⟩ ↝ λQ.λP.∃x.[P(x) ∧ Q(x)]$ - something: $⟨⟨e,t⟩,t⟩ ↝ λP.∃x.P(x)$ - no: $⟨⟨e,t⟩,⟨⟨e,t⟩,t⟩⟩ ↝ λQ.λP.∀x.[P(x) → ¬Q(x)] (or λQ.λP.¬∃x.[P(x) ∧ Q(x)])$ - nothing: $⟨⟨e,t⟩,t⟩ ↝ λP.¬∃x.P(x)$ (or $λP.∀x.¬P(x)$) ### Reference ### Numbers and Plurality ### Event Semantics ### Tense and Aspect ## Beyond Truth ### Necessity and Possibility ### Command, Request, Obligation > *Alice, run!*
> *Alice, please run.*
> *Alice should run.* ### Questions ## Resources - ✨ [Invitation to Formal Semantics](https://eecoppock.info/bootcamp/semantics-boot-camp.pdf)