Computable Functionals of Finite Types in Montague Semantics
Computable Functionals of Finite Types in Montague Semantics
Сибирские электронные математические известия, 21, 2, стр. 1460-1472 (2024)
Аннотация:
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 $\Sigma$-predicates of finite types in admissible sets introduced by Yu.L.Ershov.
Ключевые слова: Montague semantics, functionals of finite types, generalized computability, $\Sigma$-predicates, $\Sigma$-operators