Complexity of categorical theories with computable models

zbMATH Open1144.03307MaRDI QIDQ859246FDOQ859246

N. E. Zubov

Publication date: 12 January 2007

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

zbMATH Keywords

arithmetical hierarchyconstructive modelscomputable modelsalgorithmic structure of theories

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (5)

• Categoricity and generalized model completeness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computably categorical structures and expansions by constants
• Applications of Kolmogorov complexity to computable model theory

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Categoricity of computable infinitary theories 👍 👎
• On the complexity of categoricity in computable structures 👍 👎
• The complexity of computable categoricity 👍 👎
• Complexity of Categorical Theories with Computable Models 👍 👎
• Categoricity and generalized model completeness 👍 👎
• Computability models over categories and presheaves 👍 👎
• Complexity of categorical theories with computable models 👍 👎
• A categorial approach to the theory of computation 👍 👎

This page was built for publication: Complexity of categorical theories with computable models

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