A First-Order Axiomatization of the Theory of Finite Trees (1995)
Cached
Download Links
- [www.ircs.upenn.edu]
- [ftp.tcs.informatik.uni-muenchen.de]
- DBLP
Other Repositories/Bibliography
| Venue: | JOURNAL OF LOGIC, LANGUAGE AND INFORMATION |
| Citations: | 46 - 3 self |
BibTeX
@ARTICLE{Backofen95afirst-order,
author = {Rolf Backofen and James Rogers and K. Vijay-shanker},
title = {A First-Order Axiomatization of the Theory of Finite Trees},
journal = {JOURNAL OF LOGIC, LANGUAGE AND INFORMATION},
year = {1995},
volume = {4},
pages = {5--39}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We provide first-order axioms for the theories of finite trees with bounded branching and finite trees with arbitrary (finite) branching. The signature is chosen to express, in a natural way, those properties of trees most relevant to linguistic theories. These axioms provide a foundation for results in linguistics that are based on reasoning formally about such properties. We include some observations on the expressive power of these theories relative to traditional language complexity classes.
