Generalized Computability and Model Theory for Linguistic Structures Conference Abstracts
| Conference |
Международная конференция "Мальцевские чтения" 10-14 Nov 2025 , Новосибирск, ИМ СО РАН |
||||
|---|---|---|---|---|---|
| Source | Международная конференция МАЛЬЦЕВСКИЕ ЧТЕНИЯ 10–14 ноября 2025 г. Тезисы докладов Compilation, 2025. 236 c. |
||||
| Output data | Year: 2025, Pages: 35 Pages count : 1 | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
There is a remarkable list of mathematicians who contributed to both generalized computability theory and mathematical linguistics, including R. Montague, J. Barwise and Y. Moschovakis. In this talk, we discuss results of Yu.L. Ershov on approximation spaces and finite type functionals, which allow to construct generalized computable models for formal semantics (also known as Montague semantics) of natural languages, unifying generalized computability with mathematical linguistics. We survey our recent results and discuss some open questions.
Cite:
Stukachev A.I.
Generalized Computability and Model Theory for Linguistic Structures
In compilation Международная конференция МАЛЬЦЕВСКИЕ ЧТЕНИЯ 10–14 ноября 2025 г. Тезисы докладов. 2025. – C.35.
Generalized Computability and Model Theory for Linguistic Structures
In compilation Международная конференция МАЛЬЦЕВСКИЕ ЧТЕНИЯ 10–14 ноября 2025 г. Тезисы докладов. 2025. – C.35.
Identifiers:
No identifiers
Citing:
Пока нет цитирований