The complexity of index sets for several classes of models

zbMATH Open1249.03062MaRDI QIDQ2885248FDOQ2885248

Authors: E. N. Pavlovskij 

Publication date: 21 May 2012

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

Recommendations

• Estimation of the algorithmic complexity of classes of computable models
• Index sets for some classes of structures
• scientific article; zbMATH DE number 3853049
• scientific article; zbMATH DE number 5175704
• Index sets of autostable relative to strong constructivizations constructive models for familiar classes

zbMATH Keywords

recursion theorycategoricitycategorical theory

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cited In (5)

• The complexity of countable categoricity in finite languages
• Estimation of the algorithmic complexity of classes of computable models
• Index sets for some classes of structures
• Title not available (Why is that?)
• Index sets of prime models

This page was built for publication: The complexity of index sets for several classes of models

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