Decidable characterizations for tree logics
In this thesis we investigate the expressive power of several logics over finite trees. In particular we want to understand precisely the expressive power of first-order logic over finite trees. Because we study many logics, we proceed by comparison to a logic that subsumes them all and serves as a...
| Main Author: | |
|---|---|
| Language: | ENG |
| Published: |
École normale supérieure de Cachan - ENS Cachan
2010
|
| Subjects: | |
| Online Access: | http://tel.archives-ouvertes.fr/tel-00744954 http://tel.archives-ouvertes.fr/docs/00/74/49/54/PDF/Place2010.pdf |