Algorithmic complexity of countable models of strongly minimal theories

MaRDI QIDQ2885255zbMATH OpenFDO

Authors S. S. Goncharov

Publication date 21 May 2012

Published in Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

zbMATH Keywords

computable structurehyperarithmetical hierarchystrongly minimal set

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Hierarchies of computability and definability (03D55)

Recommendations

• On two problems of Turing complexity for strongly minimal theories
• On the computability-theoretic complexity of trivial, strongly minimal models
• Strongly minimal theories with recursive models
• Estimation of the algorithmic complexity of classes of computable models
• scientific article; zbMATH DE number 1936725

Cited in

(8)

• Strongly minimal theories with recursive models
• Building models of strongly minimal theories
• Trivial, strongly minimal theories are model complete after naming constants
• Model-theoretic Elekes–Szabó in the strongly minimal case
• On the computability-theoretic complexity of trivial, strongly minimal models
• scientific article; zbMATH DE number 5215800 (Why is no real title available?)
• On two problems of Turing complexity for strongly minimal theories
• Complexity ranks of countable models

This page was built for publication: Algorithmic complexity of countable models of strongly minimal theories

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