The branching theorem and computable categoricity in the Ershov hierarchy
From MaRDI portal
Publication:887636
DOI10.1007/s10469-015-9329-6zbMath1337.03062OpenAlexW1179613215MaRDI QIDQ887636
Publication date: 27 October 2015
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-015-9329-6
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35) Hierarchies of computability and definability (03D55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Noncomputability of classes of Pappian and Desarguesian projective planes
- Positive undecidable numberings in the Ershov hierarchy
- Computably categorical Boolean algebras enriched by ideals and atoms
- Computable categoricity and the Ershov hierarchy
- Autostability of models and Abelian groups
- Autostability of models
- Autostability of Boolean algebras with distinguished ideal
- Computable structures and the hyperarithmetical hierarchy
- On a hierarchy of sets. III
- Relative autostability of direct sums of Abelian p-groups
- Rogers semilattices of families of two embedded sets in the Ershov hierarchy
- Recursive isomorphism types of recursive Boolean algebras
- The class of projective planes is noncomputable
- Equivalence structures and isomorphisms in the difference hierarchy
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- Recursively Categorical Linear Orderings
- Autostable I-Algebras
This page was built for publication: The branching theorem and computable categoricity in the Ershov hierarchy