A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis of the logical models and algorithms currently used in natural language semantics, defined as the mapping of a statement to logical formulas -formulas, because a statement can be ambiguous. We argue that as long as possible world semantics is left out, one can compute the semanticdoi:10.1007/s10849-019-09290-7 fatcat:xnkyltzmrngbdkuo73m5dcptqi