STACS 2002

Volume 2285 of the series Lecture Notes in Computer Science pp 596-607


Axiomatising Tree-Interpretable Structures

  • Achim BlumensathAffiliated withRWTH Aachen

* Final gross prices may vary according to local VAT.

Get Access


Generalising the notion of a prefix-recognisable graph to arbitrary relational structures we introduce the class of tree-interpretable structures.We prove that every tree-interpretable structure is finitely axiomatisable in guarded second-order logic with cardinality quantifiers.