Computable Functionals of Finite Types in Montague Semantics

Authors

  • Алексей Ильич Стукачёв ИМ СО РАН

Keywords:

Montague semantics, functionals of finite types, generalized computability, $\Sigma$-operators

Abstract

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.

Published

2025-03-03

Issue

Vol. 21 No. 2 (2024): Vol. 21, No. 2, 2024

Section

Mathematical logic, algebra and number theory