Glossary:Sorts/Types: Difference between revisions
No edit summary |
No edit summary |
||
| Line 9: | Line 9: | ||
== Definition == | == Definition == | ||
In logic and semantics a concept of type is often used to distinguish different | |||
kinds of expression (and of semantic value). These types are used as syntactic | |||
categories for the expressions in the semantic representation language. Each type | |||
will correspond to a certain set of possible denotations. | |||
The (minimal) set of basic types is {e, t}: <br> | The (minimal) set of basic types is {e, t}: <br> | ||
– e (for entity) is the type of individual terms <br> | – e (for entity) is the type of individual terms <br> | ||
| Line 17: | Line 21: | ||
In short: The set of types is the smallest set T such that | In short: The set of types is the smallest set T such that | ||
e,tєT, and if ϭ,τ єT, then also <ϭ,τ> єT. <br> | e,tєT, and if ϭ,τ єT, then also <ϭ,τ> єT. <br> | ||
== Examples == | == Examples == | ||
Revision as of 22:43, 17 November 2012
Warning:
The material on this page has been created as part of a seminar. It is still heavily under construction and we do not guarantee its correctness. If you have comments on this page or suggestions for improvement, please contact Manfred Sailer.
This note will be removed once the page has been carefully checked and integrated into the main part of this wiki.
Sorts/Types
AE:
- Type: (/taɪp/)
- Sort: (/sɔː(r)t/)
Definition
In logic and semantics a concept of type is often used to distinguish different
kinds of expression (and of semantic value). These types are used as syntactic
categories for the expressions in the semantic representation language. Each type
will correspond to a certain set of possible denotations.
The (minimal) set of basic types is {e, t}:
– e (for entity) is the type of individual terms
– t (for truth value) is the type of formulae
All pairs <ϭ, τ> made up of (basic or complex) types ϭ, τ
are types. <ϭ, τ> is the type of functions which map
arguments of type ϭ to values of type τ.
In short: The set of types is the smallest set T such that
e,tєT, and if ϭ,τ єT, then also <ϭ,τ> єT.