Lecture Notes in Computer Science Volume 2285, 2002, pp 596-607
Date: 21 Feb 2002

Axiomatising Tree-Interpretable Structures

* 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.