Computer Science – Computation and Language
Scientific paper
2011-02-25
Computer Science
Computation and Language
48 pages
Scientific paper
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities. This class is proven to precisely coincide with the class of logically closed languages that may be thought of as functions from expressions to sets of logically equivalent Ty_n terms. For a specific sub-class of logically closed languages that are described by finite sets of rules or rule schemata, we find effective procedures for building a compact Ty_n representation, involving a finite number of axioms or axiom schemata. The proposed formalism is characterized by some useful features unavailable in a two-component architecture of a language model. A further specialization and extension of the formalism with a context type enable effective account of intensional and dynamic semantics.
No associations
LandOfFree
Universal Higher Order Grammar does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Universal Higher Order Grammar, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Higher Order Grammar will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-709545