Variable free reasoning on finite trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Variable free reasoning on finite trees


In this paper we examine three modal languages that have been proposed in the model-theoretic syntax literature for describing finite ordered trees. We compare their expressive power, and then examine a key complexity-theoretic issue: how expensive is it to decide --- given a theory specifying a certain class of trees --- whether a formula describes a model? Our main result is that for two of these languages this problem is EXPTIME-complete.


Other [cs.OH]
No file

Dates and versions

inria-00099716 , version 1 (26-09-2006)


  • HAL Id : inria-00099716 , version 1


Patrick Blackburn, Bertrand Gaiffe, Maarten Marx. Variable free reasoning on finite trees. Proceedings of Mathematics of Language - MOL-8, Jun 2003, Bloomington, Indiana, USA. ⟨inria-00099716⟩
57 View
0 Download


Gmail Facebook Twitter LinkedIn More