Automatic models of first order theories

DOI10.1016/J.APAL.2013.03.001zbMATH Open1328.03037OpenAlexW1991893284MaRDI QIDQ387121FDOQ387121

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

Recommendations

• scientific article; zbMATH DE number 46359
• Automatic synthesis of logical models for order-sorted first-order theories
• First-order automated reasoning with theories: when deduction modulo theory meets practice
• scientific article; zbMATH DE number 1301853
• scientific article; zbMATH DE number 837700
• 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
• scientific article; zbMATH DE number 67794

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)

Cites Work

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

Cited In (9)

• Calculs sur les structures de langage dénombrable
• Title not available (Why is that?)
• Title not available (Why is that?)
• First-order automated reasoning with theories: when deduction modulo theory meets practice
• On First-Order Model-Based Reasoning
• First-order abduction as enumeration of stable models
• Title not available (Why is that?)
• First order theories for partial models
• Inductive Logic Programming

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)