Skip to main content
SpringerLink
Log in

Axiomatising Tree-Interpretable Structures

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Mathematische Grundlagen der Informatik, RWTH Aachen, 52056 Aachen, Germany

    Achim Blumensath

Authors
  1. Achim Blumensath
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Achim Blumensath.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blumensath, A. Axiomatising Tree-Interpretable Structures. Theory Comput Systems 37, 3–27 (2004). https://doi.org/10.1007/s00224-003-1104-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-003-1104-8

Keywords

Search

Navigation