Axiomatising Tree-Interpretable Structures
Achim Blumensath, Achim Blumensath, Rwth Aachen · 2001
Abstract Generalising the notion of a prefix-recognisable graph to ar-bitrary 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. 1