summaryrefslogtreecommitdiff
path: root/linguistics
diff options
context:
space:
mode:
authorJJ2024-03-17 20:26:54 +0000
committerJJ2024-03-17 20:26:54 +0000
commit93689618c67e8d6f5db9702097d614d3fbd1ab57 (patch)
tree79213faaddf49eec52b60307ab5f492fabf64d78 /linguistics
parent32b9ed9190261086953545465634ae1954f59dd3 (diff)
meow
Diffstat (limited to 'linguistics')
-rw-r--r--linguistics/semantics.md7
1 files changed, 7 insertions, 0 deletions
diff --git a/linguistics/semantics.md b/linguistics/semantics.md
index 7615145..fc7feb2 100644
--- a/linguistics/semantics.md
+++ b/linguistics/semantics.md
@@ -11,3 +11,10 @@ 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?
+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 is [first-order/predicate logic](../mathematics/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 to denote *set membership*.
+
+
+## Resources
+- ✨ [Invitation to Formal Semantics](https://eecoppock.info/bootcamp/semantics-boot-camp.pdf)