On two problems of Turing complexity for strongly minimal theories

DOI10.1134/S1064562408030319zbMath1152.03023OpenAlexW1982282415MaRDI QIDQ954212

Sergei S. Goncharov

Publication date: 10 November 2008

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562408030319

zbMATH Keywords

algorithmic complexitycountable modelscomputable model theorystrongly minimal theoriescomplexity of theoriesTuring complexity

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computable structure theory, computable model theory (03C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Computable models of theories with few models
• Computable structures and the hyperarithmetical hierarchy
• Recursively presentable prime models
• Trivial, strongly minimal theories are model complete after naming constants
• On the computability-theoretic complexity of trivial, strongly minimal models
• On strongly minimal sets

This page was built for publication: On two problems of Turing complexity for strongly minimal theories