Transforming structures by set interpretations

DOI10.2168/LMCS-3(2:4)2007zbMath1128.03026MaRDI QIDQ5310689

Christof Löding, Thomas Colcombet

Publication date: 11 October 2007

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Computable structure theory, computable model theory (03C57)

Related Items (12)

Tree-automatic scattered linear orders ⋮ Simple monadic theories and partition width ⋮ Second-order finite automata ⋮ Rewriting Higher-Order Stack Trees ⋮ Rewriting higher-order stack trees ⋮ The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic ⋮ Regular model checking revisited ⋮ When Is Reachability Intrinsically Decidable? ⋮ On the Complexity of Infinite Advice Strings ⋮ Unnamed Item ⋮ Uniformly Automatic Classes of Finite Structures ⋮ Cardinality Quantifiers in MLO over Trees

This page was built for publication: Transforming structures by set interpretations