Natural language semantics and its computable analysis

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With an illustrative example of 5 × 3 = 5 × 3, the first section explained the major problem in the natural language interpretation process. The second section introduced Frege’s famous idea of ‘sense’. And this paper argues that Frege’s definition is not constructive. The Third section contributes a subtle amendment to the syntax of IL (Intentional Logic). Traditionally, the three basic types e, t and s were not treated as a part of vocabulary of IL, while this paper argues that this treatment has allowed a much explicit way to coding programs in real algorithm. Given this treatment, “an expression α of type T” is shortened to “α|T”. In the end of section three, this paper gave a natural language sentence to illustrate the intention and extension operators. And furthermore, there comes the analyses of information preservation ability of these operators.

Cite

CITATION STYLE

APA

Liang, Z., & Zou, C. (2018). Natural language semantics and its computable analysis. In IFIP Advances in Information and Communication Technology (Vol. 539, pp. 221–229). Springer New York LLC. https://doi.org/10.1007/978-3-030-01313-4_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free