Model-theoretic properties of \(\omega\)-automatic structures
From MaRDI portal
Publication:2254518
DOI10.1007/s00224-013-9508-6zbMath1335.03037MaRDI QIDQ2254518
Łukasz Kaiser, Erich Grädel, Faried Abu Zaid, Wied Pakusa
Publication date: 5 February 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9508-6
03D05: Automata and formal grammars in connection with logical questions
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite presentations of infinite structures: Automata and interpretations
- Automaticity of ordinals and of homogeneous graphs
- The additive group of the rationals does not have an automatic presentation
- Is Ramsey's theorem omega-automatic?
- Describing Groups
- AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
- Automatic Structures: Richness and Limitations
- First-order and counting theories ofω-automatic structures
- Decidability of Second-Order Theories and Automata on Infinite Trees