Axiomatising Tree-Interpretable Structures

  • Achim Blumensath
Conference paper

DOI: 10.1007/3-540-45841-7_49

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2285)
Cite this paper as:
Blumensath A. (2002) Axiomatising Tree-Interpretable Structures. In: Alt H., Ferreira A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Achim Blumensath
    • 1
  1. 1.RWTH AachenAachen

Personalised recommendations