A Note On Higher Order Grammar
Computation and Language
2009-10-06 v1
Abstract
Both syntax-phonology and syntax-semantics interfaces in Higher Order Grammar (HOG) are expressed as axiomatic theories in higher-order logic (HOL), i.e. a language is defined entirely in terms of provability in the single logical system. An important implication of this elegant architecture is that the meaning of a valid expression turns out to be represented not by a single, nor even by a few "discrete" terms (in case of ambiguity), but by a "continuous" set of logically equivalent terms. The note is devoted to precise formulation and proof of this observation.
Cite
@article{arxiv.0910.0537,
title = {A Note On Higher Order Grammar},
author = {Victor Gluzberg},
journal= {arXiv preprint arXiv:0910.0537},
year = {2009}
}
Comments
7 pages in single-spaced pdf format