An uncountably categorical theory whose only computably presentable model is saturated

DOI10.1305/ndjfl/1143468311zbMath1107.03032OpenAlexW2049842103MaRDI QIDQ2505131

Pavel Semukhin, Denis R. Hirschfeldt, Bakhadyr Khoussainov

Publication date: 4 October 2006

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1143468311

zbMATH Keywords

computable structure\(\aleph_1\)-categoricitycomputably presentable model

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Categoricity and completeness of theories (03C35)

Related Items (9)

A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES ⋮ A new spectrum of recursive models using an amalgamation construction ⋮ Iterated effective embeddings of abelian p-groups ⋮ Automatic models of first order theories ⋮ Recursive spectra of flat strongly minimal theories ⋮ Applications of Kolmogorov complexity to computable model theory ⋮ Spectra of recursive models of disintegrated strongly minimal theories ⋮ Limitwise monotonic sequences and degree spectra of structures ⋮ IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE

Cites Work

• Theory of Abelian groups with constructive models
• A new spectrum of recursive models
• Constructive models of \(\aleph_1\)-categorical theories
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• Computable models of theories with few models
• Recursively presentable prime models
• On strongly minimal sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An uncountably categorical theory whose only computably presentable model is saturated