A note on decidable categoricity and index sets
DOI10.33048/SEMI.2020.17.076zbMATH Open1443.03020OpenAlexW3116823825MaRDI QIDQ2200982FDOQ2200982
Authors: Nikolay Bazhenov, Margaret I. Marchuk
Publication date: 24 September 2020
Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2020.17.076
Recommendations
index setreal closed fieldstrong constructivizationautostability relative to strong constructivizationsdecidable structureequivalence structuredecidable categoricity
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Title not available (Why is that?)
- Model theory
- Title not available (Why is that?)
- Autostability of models
- Strong and weak constructivization and computable families
- Computable structures and the hyperarithmetical hierarchy
- Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations
- Index sets of computable structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
- Effective categoricity of equivalence structures
- Title not available (Why is that?)
- Recursively presentable prime models
- Title not available (Why is that?)
- Strong constructivizability of homogeneous models
- Decidable models
- Degrees of autostability relative to strong constructivizations
- On autostability of almost prime models relative to strong constructivizations
- The complexity of computable categoricity
- Title not available (Why is that?)
- The index set of the groups autostable relative to strong constructivizations
- Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
- Computable abelian groups
- 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 isomorphism problem for classes of computable fields
- Constructive models of complete solvable theories
- \({\Sigma}^0_1\) and \({\Pi}^0_1\) equivalence structures
- Degree spectra of real closed fields
- Decompositions of decidable abelian groups
- Criterion for strong constructivizability of a homogeneous model
- Constructing decidable graphs from decidable structures
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Turing degrees of complete formulas of almost prime models
- Title not available (Why is that?)
- Effective prime uniqueness
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
Cited In (6)
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
- There is no classification of the decidably presentable structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- The index set of uncountably categorical theories
- Generalization of Shapiro's theorem to higher arities and noninjective notations
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)