Transforming structures by set interpretations
From MaRDI portal
Publication:5310689
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)
03D05: Automata and formal grammars in connection with logical questions
03B25: Decidability of theories and sets of sentences
03C57: Computable structure theory, computable model theory
Related Items
Unnamed Item, On the Complexity of Infinite Advice Strings, Uniformly Automatic Classes of Finite Structures, Regular model checking revisited, Tree-automatic scattered linear orders, Second-order finite automata, Rewriting higher-order stack trees, The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic, Simple monadic theories and partition width, Rewriting Higher-Order Stack Trees, When Is Reachability Intrinsically Decidable?, Cardinality Quantifiers in MLO over Trees