Standard

Generalized Computable Models and Montague Semantics. / Burnistov, Artem; Stukachev, Alexey.

Studies in Computational Intelligence. Springer Science and Business Media Deutschland GmbH, 2023. p. 107-124 5 (Studies in Computational Intelligence; Vol. 1081).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Research › peer-review

Harvard

Burnistov, A & Stukachev, A 2023, Generalized Computable Models and Montague Semantics. in Studies in Computational Intelligence., 5, Studies in Computational Intelligence, vol. 1081, Springer Science and Business Media Deutschland GmbH, pp. 107-124, Symposium on Logic and Algorithms in Computational Linguistics, 13.12.2021. https://doi.org/10.1007/978-3-031-21780-7_5

APA

Burnistov, A., & Stukachev, A. (2023). Generalized Computable Models and Montague Semantics. In Studies in Computational Intelligence (pp. 107-124). [5] (Studies in Computational Intelligence; Vol. 1081). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-21780-7_5

Vancouver

Burnistov A, Stukachev A. Generalized Computable Models and Montague Semantics. In Studies in Computational Intelligence. Springer Science and Business Media Deutschland GmbH. 2023. p. 107-124. 5. (Studies in Computational Intelligence). doi: 10.1007/978-3-031-21780-7_5

Author

Burnistov, Artem ; Stukachev, Alexey. / Generalized Computable Models and Montague Semantics. Studies in Computational Intelligence. Springer Science and Business Media Deutschland GmbH, 2023. pp. 107-124 (Studies in Computational Intelligence).

BibTeX

@inbook{5695b3e199f74bcbb323af06a902da7f,
title = "Generalized Computable Models and Montague Semantics",
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.",
keywords = "Functionals of finite types, Generalized computability, Intensional logic, Montague semantics, predicates",
author = "Artem Burnistov and Alexey Stukachev",
note = "The research was supported by the IM SB RAS state assignment, project number FWNF-2022-0012.; Symposium on Logic and Algorithms in Computational Linguistics, LACompLing 2021 ; Conference date: 13-12-2021 Through 17-12-2021",
year = "2023",
doi = "10.1007/978-3-031-21780-7_5",
language = "English",
isbn = "9783031217791",
series = "Studies in Computational Intelligence",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "107--124",
booktitle = "Studies in Computational Intelligence",
address = "Germany",

}

RIS

TY - CHAP

T1 - Generalized Computable Models and Montague Semantics

AU - Burnistov, Artem

AU - Stukachev, Alexey

N1 - The research was supported by the IM SB RAS state assignment, project number FWNF-2022-0012.

PY - 2023

Y1 - 2023

N2 - 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.

AB - 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.

KW - Functionals of finite types

KW - Generalized computability

KW - Intensional logic

KW - Montague semantics

KW - predicates

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85151079734&origin=inward&txGid=882b2e1016a2246a4f640e4d1ee6c4ac

UR - https://www.mendeley.com/catalogue/4cfe6203-6b5e-39fe-ace1-d9180ef0832b/

U2 - 10.1007/978-3-031-21780-7_5

DO - 10.1007/978-3-031-21780-7_5

M3 - Chapter

SN - 9783031217791

T3 - Studies in Computational Intelligence

SP - 107

EP - 124

BT - Studies in Computational Intelligence

PB - Springer Science and Business Media Deutschland GmbH

T2 - Symposium on Logic and Algorithms in Computational Linguistics

Y2 - 13 December 2021 through 17 December 2021

ER -

ID: 55818088