scientific article

zbMATH Open1116.03028MaRDI QIDQ3434485FDOQ3434485

Author name not available (Why is that?)

Publication date: 2 May 2007

Title of this publication is not available (Why is that?)

zbMATH Keywords

computable model theorycategorical theoriesdecidable modelscomplexity of index sets

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28)

Cited In (5)

• Complexity of categorical theories with computable models
• The complexity of countable categoricity in finite languages
• Autostability of prime models under strong constructivizations
• The degrees of categorical theories with recursive models
• Computably categorical structures and expansions by constants

This page was built for publication:

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