Computable models of theories with few models
From MaRDI portal
Publication:1381432
DOI10.1305/ndjfl/1039724885zbMath0891.03013OpenAlexW2070346525MaRDI QIDQ1381432
Bakhadyr Khoussainov, Richard A. Shore, André Nies
Publication date: 4 May 1998
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1039724885
Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15) Categoricity and completeness of theories (03C35)
Related Items
Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees, Limitwise monotonic reducibility on sets and on pairs of sets, A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES, A new spectrum of recursive models using an amalgamation construction, Effectively categorical abelian groups, On the computability-theoretic complexity of trivial, strongly minimal models, On limitwise monotonicity and maximal block functions, On Decidable and Computable Models of Theories, Iterated effective embeddings of abelian p-groups, Automatic models of first order theories, Computable torsion abelian groups, Rogers semilattices of limitwise monotonic numberings, Enumerating abelian \(p\)-groups, A Friedberg enumeration of equivalence structures, New spectra of strongly minimal theories in finite languages, Prime models of theories of computable linear orderings, Computable shuffle sums of ordinals, 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10, On two problems of Turing complexity for strongly minimal theories, A computable ℵ0-categorical structure whose theory computes true arithmetic, Recursive spectra of flat strongly minimal theories, 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06, Applications of Kolmogorov complexity to computable model theory, A new spectrum of recursive models, Spectra of recursive models of disintegrated strongly minimal theories, Maximality and minimality under limitwise monotonic reducibility, Effective categoricity of equivalence structures, Limitwise monotonic functions, sets, and degrees on computable domains, An uncountably categorical theory whose only computably presentable model is saturated, COMPUTABLE ABELIAN GROUPS, Limitwise monotonic reducibility of sets and \(\Sigma\)-definability of abelian groups, Degree spectra of structures, Classifying model-theoretic properties, Effective categoricity of abelian \(p\)-groups, Scott sentences for equivalence structures, Limitwise monotonic sequences and degree spectra of structures, η-representation of sets and degrees, Limitwise monotonic sets of reals, On \(\Delta_2^0\)-categoricity of equivalence relations, IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE, Theory spectra and classes of theories, Limitwise monotonic spectra and their generalizations
Cites Work
