Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
DOI10.1007/s10469-015-9357-2zbMath1375.03051OpenAlexW2471267115MaRDI QIDQ5965131
Publication date: 2 March 2016
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-015-9357-2
computable structure\(\Delta_{\alpha}^{0}\)-categorical structure\(\Delta_{\alpha}^{0}\)-dimension of computable structure\(\Sigma_{\alpha}\) Scott familyAsh's theorem
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)
Cites Work
- Unnamed Item
- Unnamed Item
- Generic copies of countable structures
- Autostability of models and Abelian groups
- Autostability of models
- Autostability and computable families of constructivizations
- The quantity of nonautoequivalent constructivizations
- Computable structures and the hyperarithmetical hierarchy
- Categoricity in hyperarithmetical degrees
- Enumerations in computable structure theory
- Intrinsic bounds on complexity and definability at limit levels
- Autostable I-Algebras
- Effective model theory vs. recursive model theory
This page was built for publication: Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
