On Decidable and Computable Models of Theories

DOI10.1007/978-3-642-39053-1_23zbMath1433.03084MaRDI QIDQ5326370

Bakhadyr Khoussainov, Aleksandr Nikolaevich Gavryushkin

Publication date: 5 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39053-1_23

Mathematics Subject Classification ID

03B25: Decidability of theories and sets of sentences

03C57: Computable structure theory, computable model theory

Related Items

Decidable models of small theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Criterion for strong constructivizability of a homogeneous model
• Strong constructivizability of homogeneous models
• On complete theories with a finite number of denumerable models
• Decidable models
• Computable models of theories with few models
• Constructive models of complete solvable theories
• RELATIVE TO ANY NON-HYPERARITHMETIC SET
• Computable trees, prime models, and relative decidability
• Degree spectra and immunity properties
• The degree spectra of homogeneous models
• Omitting types, type spectrums, and decidability
• Attention à la marche!
• An introduction to forking
• Foundations of recursive model theory
• Recursively presentable prime models
• Complete Theories with Finitely Many Countable Models. I
• Applications of Kolmogorov complexity to computable model theory