Categorical Framework for Typed Extensional and Intensional Models in Formal Semantics
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910588937961472 |
|---|---|
| author | Quigley, Daniel |
| author_facet | Quigley, Daniel |
| contents | Intensional computation derives concrete outputs from abstract function definitions; extensional computation defines functions through explicit input-output pairs. In formal semantics: intensional computation interprets expressions as context-dependent functions; extensional computation evaluates expressions based on their denotations in an otherwise fixed context. This paper reformulates typed extensional and intensional models of formal semantics within a category-theoretic framework and demonstrates their natural representation therein. We construct $\textbf{ModInt}$, the category of intensional models, building on the categories $\textbf{Set}$ of sets, $\textbf{Rel}$ of relations, and $\textbf{Kr}$ and $\textbf{Kr}_\textbf{b}$ of Kripke frames with monotone maps and bounded morphisms, respectively. We prove that trivial intensional models are equivalent to extensional models, providing a unified categorical representation of intensionality and extensionality in formal semantics. This approach reinterprets the relationship between intensions and extensions in a categorical framework and offers a modular, order-independent method for processing intensions and recovering extensions; contextualizing the relationship between content and reference in category-theoretic terms. We discuss implications for natural language semantics and propose future directions for contextual integration and exploring $\textbf{ModInt}$'s algebraic properties. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_07058 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Categorical Framework for Typed Extensional and Intensional Models in Formal Semantics Quigley, Daniel Category Theory Logic 18C10 (Primary), 18C50 (Secondary) Intensional computation derives concrete outputs from abstract function definitions; extensional computation defines functions through explicit input-output pairs. In formal semantics: intensional computation interprets expressions as context-dependent functions; extensional computation evaluates expressions based on their denotations in an otherwise fixed context. This paper reformulates typed extensional and intensional models of formal semantics within a category-theoretic framework and demonstrates their natural representation therein. We construct $\textbf{ModInt}$, the category of intensional models, building on the categories $\textbf{Set}$ of sets, $\textbf{Rel}$ of relations, and $\textbf{Kr}$ and $\textbf{Kr}_\textbf{b}$ of Kripke frames with monotone maps and bounded morphisms, respectively. We prove that trivial intensional models are equivalent to extensional models, providing a unified categorical representation of intensionality and extensionality in formal semantics. This approach reinterprets the relationship between intensions and extensions in a categorical framework and offers a modular, order-independent method for processing intensions and recovering extensions; contextualizing the relationship between content and reference in category-theoretic terms. We discuss implications for natural language semantics and propose future directions for contextual integration and exploring $\textbf{ModInt}$'s algebraic properties. |
| title | Categorical Framework for Typed Extensional and Intensional Models in Formal Semantics |
| topic | Category Theory Logic 18C10 (Primary), 18C50 (Secondary) |
| url | https://arxiv.org/abs/2408.07058 |