A new spectrum of recursive models

DOI10.1305/NDJFL/1022615611zbMATH Open1007.03036OpenAlexW2007036268MaRDI QIDQ701304FDOQ701304

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

Recommendations

• New spectra of strongly minimal theories in finite languages
• Spectra of recursive models of disintegrated strongly minimal theories
• A new spectrum of recursive models using an amalgamation construction
• On spectra of computable models
• Recursive spectra of flat strongly minimal theories

zbMATH Keywords

strongly minimal theorycountable modelscomputable presentation\(\omega_1\)-categorical theorycomplexity of spectra

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On strongly minimal sets
• Computable models of theories with few models
• Title not available (Why is that?)

Cited In (11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701304)