A note on decidable categoricity and index sets
From MaRDI portal
Publication:2200982
Recommendations
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3425533 (Why is no real title available?)
- scientific article; zbMATH DE number 5379427 (Why is no real title available?)
- scientific article; zbMATH DE number 3779289 (Why is no real title available?)
- scientific article; zbMATH DE number 1302870 (Why is no real title available?)
- scientific article; zbMATH DE number 2047478 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- scientific article; zbMATH DE number 3201718 (Why is no real title available?)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Autostability of models
- Computable abelian groups
- Computable structures and the hyperarithmetical hierarchy
- Constructing decidable graphs from decidable structures
- Constructive models of complete solvable theories
- Criterion for strong constructivizability of a homogeneous model
- Decidable models
- Decompositions of decidable abelian groups
- Degree spectra of real closed fields
- Degrees of autostability relative to strong constructivizations
- Effective categoricity of equivalence structures
- Effective prime uniqueness
- Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
- Index sets of computable structures
- Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
- Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- Model theory
- On autostability of almost prime models relative to strong constructivizations
- Recursively presentable prime models
- Strong and weak constructivization and computable families
- Strong constructivizability of homogeneous models
- The complexity of computable categoricity
- The index set of Boolean algebras autostable relative to strong constructivizations
- The index set of linear orderings that are autostable relative to strong constructivizations
- The index set of the groups autostable relative to strong constructivizations
- The isomorphism problem for classes of computable fields
- Turing degrees of complete formulas of almost prime models
- \({\Sigma}^0_1\) and \({\Pi}^0_1\) equivalence structures
Cited in
(6)- scientific article; zbMATH DE number 5175704 (Why is no real title available?)
- There is no classification of the decidably presentable structures
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
- The index set of uncountably categorical theories
- Generalization of Shapiro's theorem to higher arities and noninjective notations
- scientific article; zbMATH DE number 5379427 (Why is no real title available?)
This page was built for publication: A note on decidable categoricity and index sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200982)