A new spectrum of recursive models

DOI10.1305/ndjfl/1022615611zbMath1007.03036OpenAlexW2007036268MaRDI QIDQ701304

André Nies

Publication date: 27 March 2003

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

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

zbMATH Keywords

countable modelsstrongly minimal theorycomputable presentation\(\omega_1\)-categorical theorycomplexity of spectra

Mathematics Subject Classification ID

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

Related Items

A new spectrum of recursive models using an amalgamation construction ⋮ On the computability-theoretic complexity of trivial, strongly minimal models ⋮ Recursive spectra of flat strongly minimal theories ⋮ 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 ⋮ Spectra of recursive models of disintegrated strongly minimal theories ⋮ An uncountably categorical theory whose only computably presentable model is saturated ⋮ Classifying model-theoretic properties ⋮ IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE

Cites Work

• Unnamed Item
• Unnamed Item
• Computable models of theories with few models
• On strongly minimal sets

This page was built for publication: A new spectrum of recursive models