Automatic models of first order theories

DOI10.1016/J.APAL.2013.03.001MaRDI QIDQ387121zbMATHOpenAlexFDO

Authors Pavel Semukhin, Frank Stephan

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

automatic structuresmodel theoryprime modelsaturated modeluncountably categorical theory

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Automata and formal grammars in connection with logical questions (03D05) Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Publication:3996619
• Automatic synthesis of logical models for order-sorted first-order theories
• First-order automated reasoning with theories: when deduction modulo theory meets practice
• Publication:4247076
• Publication:4863622
• Automating theories in intuitionistic logic
• First-order logic theorem proving and model building via approximation and instantiation
• Model-theoretic complexity of automatic structures
• On First-Order Model-Based Reasoning
• Publication:4013732

Cites work

• scientific article; zbMATH DE number 3115890 (Why is no real title available?)
• scientific article; zbMATH DE number 3841819 (Why is no real title available?)
• scientific article; zbMATH DE number 5605134 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 3598440 (Why is no real title available?)
• scientific article; zbMATH DE number 2040323 (Why is no real title available?)
• scientific article; zbMATH DE number 1499098 (Why is no real title available?)
• scientific article; zbMATH DE number 3060762 (Why is no real title available?)
• An application of games to the completeness problem for formalized theories
• An uncountably categorical theory whose only computably presentable model is saturated
• Automata Presenting Structures: A Survey of the Finite String Case
• Automatic Structures: Richness and Limitations
• Automaticity of ordinals and of homogeneous graphs
• Breaking up finite automata presentable torsion-free Abelian groups.
• Computable models of theories with few models
• Deciding the isomorphism problem in classes of unary automatic structures
• Describing Groups
• Finite automata presentable Abelian groups
• On strongly minimal sets
• The additive group of the rationals does not have an automatic presentation
• The isomorphism problem for \(\omega \)-automatic trees

Cited in

(9)

• Inductive Logic Programming
• scientific article; zbMATH DE number 1301853 (Why is no real title available?)
• First-order automated reasoning with theories: when deduction modulo theory meets practice
• scientific article; zbMATH DE number 46359 (Why is no real title available?)
• First order theories for partial models
• On First-Order Model-Based Reasoning
• Calculs sur les structures de langage dénombrable
• scientific article; zbMATH DE number 3979039 (Why is no real title available?)
• First-order abduction as enumeration of stable models

This page was built for publication: Automatic models of first order theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387121)