My research focuses on the logical foundations of grammar formalisms and the mathematical properties of language (more accurately, the properties of the sets of structures that Linguists use to model languages). The majority of my research falls in the area known as Model-Theoretic Syntax.
For the last few years, working with various collaborators and my undergraduate research group, I have been focusing primarily on descriptive characterizations of classes of stringsets (sets of strings) that are weaker than the Regular stringsets. These classes turn out to be useful in a number of areas:
I have done a great deal of work on descriptive characterizations of classes of sets of more complicated structures, including Context-Free (CF) sets of strings and trees and a variety of generalizations of CF sets including those mildly context-sensitive sets that are licensed by Tree-Adjoining Grammars (TAGs) and Wier's Control Grammars. These classes are useful in, inter alia:
My doctoral studies were carried out in the Computer and Information Sciences
Department at the University Delaware under K. Vijay-Shanker. Copies of my
dissertation Studies in the Logic of Trees with Applications to Grammar
Formalisms are available from the Univ. of Delaware as Technical Report
No. 95-04, email requests to
This is not available electronically, although an
abstract is available here.