ISSN:
1572-9583
Keywords:
Trees
;
First-Order Theories
;
Axiomatizations
;
Natural Language Syntax
;
Ehrenfeucht-Fraïssé Games
Source:
Springer Online Journal Archives 1860-2000
Topics:
Linguistics and Literary Studies
,
Computer Science
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01048403
Permalink