scientific article; zbMATH DE number 5175704

MaRDI QIDQ5295696zbMATH OpenFDO

Authors Steffen Lempp, Theodore A. Slaman

Publication date 30 July 2007

Full work available at URL https://arxiv.org/abs/math/0610776

zbMATH Keywords

complexity of index sets of classes of first-order theories

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Properties of classes of models (03C52) Computable structure theory, computable model theory (03C57) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 1936725
• The index set of uncountably categorical theories
• A note on decidable categoricity and index sets
• Classifying \(\aleph_ 0\)-categorical theories
• Coinductive ℵ₀-categorical theories
• scientific article; zbMATH DE number 3959391
• Categoricity of theories in \(L_{\kappa \omega}\), with \(\kappa\) a compact cardinal
• scientific article; zbMATH DE number 4029520
• \(\aleph_{0}\)-categorical completely o-minimal theories
• Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations

Cited in

(10)

• Index sets for some classes of structures
• Scott sentences for certain groups
• The complexity of index sets for several classes of models
• The complexity of countable categoricity in finite languages
• Estimation of the algorithmic complexity of classes of computable models
• The index set of uncountably categorical theories
• Autostability of prime models under strong constructivizations
• scientific article; zbMATH DE number 1936725 (Why is no real title available?)
• There is no classification of the decidably presentable structures
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

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 Q5295696)