Generalized Computable Models and Montague Semantics | Sciact - Система учета научной деятельности ИМ СО РАН

Generalized Computable Models and Montague Semantics Научная публикация

Журнал

Studies in Computational Intelligence
ISSN: 1860-949X , E-ISSN: 1860-9503

Вых. Данные

Год: 2023, Том: 1081, Страницы: 107-124 Страниц : 18 DOI: 10.1007/978-3-031-21780-7_5

Ключевые слова

Montague semantics · Intensional logic · Functionals of finite types · Generalized computability · Σ-predicates

Авторы

Burnistov Artem ^2,4 , Stukachev Alexey ^1,2,3

Организации

1	Sobolev Institute of Mathematics
2	Novosibirsk State University
3	Novosibirsk State Technical University
4	Mines Paris, PSL University

Информация о финансировании (1)

Институт математики им. С.Л. Соболева СО РАН

FWNF-2022-0012

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.

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

Опубликована в печати:	12 мар. 2023 г.
Опубликована online:	12 мар. 2023 г.

Scopus:	2-s2.0-85151079734
OpenAlex:	W4323967625

БД	Цитирований
Scopus	1