Реферат: 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 logics 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.

Библиографическая ссылка: Stukachev A.I.
Algorithmic aspects of intensional logic
XV международная летняя школа-конференция «Пограничные вопросы теории моделей и универсальной алгебры» 21-28 Jun 2023