Complexity of categorical theories with computable models
type: Item
instance of: scholarly article
title: Complexity of categorical theories with computable models
zbMATH Open document ID: 1144.03307
author: N. E. Zubov
published in: Doklady Mathematics
publication date: 2007-01-12T00:00:00Z
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03C35
zbMATH DE Number: 5115808
zbMATH Keywords: constructive models
zbMATH Keywords: computable models
zbMATH Keywords: algorithmic structure of theories
zbMATH Keywords: arithmetical hierarchy
MaRDI profile type: MaRDI publication profile
Recommended article: Complexity of categorical theories with computable models
Recommended article: Complexity of Categorical Theories with Computable Models
Recommended article: The complexity of computable categoricity
Recommended article: Q4406589
Recommended article: On the complexity of categoricity in computable structures
Recommended article: Computability models over categories and presheaves
Recommended article: Categoricity of computable infinitary theories
Recommended article: Q3434485
Recommended article: A categorial approach to the theory of computation
Recommended article: Categoricity and generalized model completeness
description: scientific article; zbMATH DE number 5115808