Generalized Computable Models and Montague Semantics Full article
| Journal |
Studies in Computational Intelligence
ISSN: 1860-949X , E-ISSN: 1860-9503 |
||||||||
|---|---|---|---|---|---|---|---|---|---|
| Output data | Year: 2023, Volume: 1081, Pages: 107-124 Pages count : 18 DOI: 10.1007/978-3-031-21780-7_5 | ||||||||
| Tags | Montague semantics · Intensional logic · Functionals of finite types · Generalized computability · Σ-predicates | ||||||||
| Authors |
|
||||||||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0012 |
Abstract:
We consider algorithmic properties of mathematical models which are used in computational linguistics to formalize and represent the semantics of natural language sentences. For example, finite-order functionals play a crucial role in Montague intensional logic and formal semantics for natural languages. We discuss some computable models for the spaces of finite-order functionals based on the Ershov-Scott theory of domains and approximation spaces. As another example, in the analysis of temporal aspects of verbs the scale of time is usually identified with the ordered set of real numbers or just a dense linear order. There are many results in generalized computability about such structures, and some of them can be applied in this analysis.
Cite:
Burnistov A.
, Stukachev A.
Generalized Computable Models and Montague Semantics
Studies in Computational Intelligence. 2023. V.1081. P.107-124. DOI: 10.1007/978-3-031-21780-7_5 Scopus OpenAlex
Generalized Computable Models and Montague Semantics
Studies in Computational Intelligence. 2023. V.1081. P.107-124. DOI: 10.1007/978-3-031-21780-7_5 Scopus OpenAlex
Dates:
| Published print: | Mar 12, 2023 |
| Published online: | Mar 12, 2023 |
Identifiers:
| Scopus: | 2-s2.0-85151079734 |
| OpenAlex: | W4323967625 |
Citing:
| DB | Citing |
|---|---|
| Scopus | 1 |