Skip to main content
Conference Proceedings

Axiomatising tree-interpretable structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2285 596-607
DOI: 10.1007/3-540-45841-7_49
7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 ax-iomatisable in guarded second-order logic with cardinality quantifiers.

Cite

CITATION STYLE

APA

Blumensath, A. (2002). Axiomatising tree-interpretable structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2285, pp. 596–607). Springer Verlag. https://doi.org/10.1007/3-540-45841-7_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free