Automatic models of first order theories

DOI10.1016/j.apal.2013.03.001zbMath1328.03037MaRDI QIDQ387121

Frank Stephan, Pavel Semukhin

Publication date: 11 December 2013

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2013.03.001

zbMATH Keywords

model theory; automatic structures; prime model; saturated model; uncountably categorical theory

Mathematics Subject Classification ID

03D05: Automata and formal grammars in connection with logical questions

03C50: Models with special properties (saturated, rigid, etc.)

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures

03C35: Categoricity and completeness of theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata presentable Abelian groups
• Computable models of theories with few models
• Automaticity of ordinals and of homogeneous graphs
• Deciding the isomorphism problem in classes of unary automatic structures
• An uncountably categorical theory whose only computably presentable model is saturated
• The additive group of the rationals does not have an automatic presentation
• BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS
• An application of games to the completeness problem for formalized theories
• Automata Presenting Structures: A Survey of the Finite String Case
• Describing Groups
• The Isomorphism Problem for ω-Automatic Trees
• Automatic Structures: Richness and Limitations
• On strongly minimal sets