The monadic second-order logic of graphs VII: graphs as relational structures
Theoretical Computer Science - Special issue on logic and applications to computer science
Structural properties of context-free sets of graphs generated by vertex replacement
Information and Computation
Languages, automata, and logic
Handbook of formal languages, vol. 3
Constraint Databases
When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Back and Forth between Guarded and Modal Logics
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Trees, grids, and MSO decidability: from graphs to matroids
Theoretical Computer Science - Parameterized and exact computation
| Hi-index | 0.00 |
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.