Computable Functionals of Finite Types in Montague Semantics Full article
| Journal |
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304 |
||||||
|---|---|---|---|---|---|---|---|
| Output data | Year: 2024, Volume: 21, Number: 2, Pages: 1460-1472 Pages count : 13 DOI: 10.33048/semi.2024.21.093 | ||||||
| Tags | Montague semantics, functionals of finite types, generalized computability, Σ--predicates, Σ--operators. | ||||||
| Authors |
|
||||||
| Affiliations |
|
Funding (1)
| 1 | Mathematical Center in Akademgorodok | 075-15-2022-282 |
Abstract:
We consider a computable model of functionals of finite types used in Montague semantics to represent grammar categories in natural language sentences. The model is based on the notion of Σ--predicates of finite types in admissible sets introduced by Yu.L.Ershov.
Cite:
Burnistov A.S.
, Stukachev A.I.
Computable Functionals of Finite Types in Montague Semantics
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2024. V.21. N2. P.1460-1472. DOI: 10.33048/semi.2024.21.093 WOS Scopus
Computable Functionals of Finite Types in Montague Semantics
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2024. V.21. N2. P.1460-1472. DOI: 10.33048/semi.2024.21.093 WOS Scopus
Dates:
| Submitted: | Sep 10, 2024 |
| Accepted: | Nov 20, 2024 |
| Published print: | Dec 28, 2024 |
| Published online: | Dec 28, 2024 |
Identifiers:
| Web of science: | WOS:001399958000014 |
| Scopus: | 2-s2.0-85216979611 |
Citing:
Пока нет цитирований