Applications of Kolmogorov complexity to computable model theory

DOI10.2178/jsl/1191333855zbMath1127.03031OpenAlexW2010033157MaRDI QIDQ5422317

Pavel Semukhin, Bakhadyr Khoussainov, Frank Stephan

Publication date: 17 October 2007

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1191333855

zbMATH Keywords

Kolmogorov complexitycategorical structurecomputable structurecomputable modeluncountably categorical structure

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model theory of denumerable and separable structures (03C15) Categoricity and completeness of theories (03C35)

Related Items (2)

On Decidable and Computable Models of Theories ⋮ IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE

Cites Work

• Unnamed Item
• Definitional equivalence and algebraizability of generalized logical systems
• Computable models of theories with few models
• A computably stable structure with no Scott family of finitary formulas
• An uncountably categorical theory whose only computably presentable model is saturated
• Model Theory

This page was built for publication: Applications of Kolmogorov complexity to computable model theory