205
edits
(Mention the special syntax for presuppositions in lambda expressions) |
m (Fix a typo) |
||
Line 1: | Line 1: | ||
Toaq is a loglang, which means that from any sentence, we can unambiguously derive its meaning in logic notation. [[Syntax]] describes how this process works; '''semantics''' tells us how to interpret the result. | Toaq is a loglang, which means that from any sentence, we can unambiguously derive its meaning in logic notation. [[Syntax]] describes how this process works; '''semantics''' tells us how to interpret the result. | ||
The refgram tells you that {{Derani| |Luı nuo sá tıqra nîe náokua}} translates to <math>\exists x: \text{tıqra}_\text{w}(x).\ \exists e.\ \text{τ}(e)<\text{t}\land \text{nuo}_\text{w}(x)(e)\land \text{nıe}_\text{w}(e, \text{n}\mathrm{\acute{a}}\text{okua})</math> . The reality is that this isn't "just" logic notation: it's a very specific notation that has been purpose-built for describing natural language semantics, and this article will help you understand the core concepts behind it. | The refgram tells you that {{Derani| |Luı nuo sá tıqra nîe náokua}} translates to <math>\exists x: \text{tıqra}_\text{w}(x).\ \exists e.\ \text{τ}(e)<\text{t}\land \text{nuo}_\text{w}(x)(e)\land \text{nıe}_\text{w}(e, \text{n}\mathrm{\acute{a}}\text{okua})</math>. The reality is that this isn't "just" logic notation: it's a very specific notation that has been purpose-built for describing natural language semantics, and this article will help you understand the core concepts behind it. | ||
== Models == | == Models == |