Algorithmic complexity of countable models of strongly minimal theories

zbMATH Open1249.03057MaRDI QIDQ2885255FDOQ2885255

Authors: S. S. Goncharov 

Publication date: 21 May 2012

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

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

zbMATH Keywords

computable structurestrongly minimal sethyperarithmetical hierarchy

Mathematics Subject Classification ID

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

Cited In (7)

• On two problems of Turing complexity for strongly minimal theories
• Trivial, strongly minimal theories are model complete after naming constants
• On the computability-theoretic complexity of trivial, strongly minimal models
• Complexity ranks of countable models
• Strongly minimal theories with recursive models
• Title not available (Why is that?)
• Model-theoretic Elekes–Szabó in the strongly minimal case

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)