Categoricity in hyperarithmetical degrees
From MaRDI portal
Publication:1821772
DOI10.1016/0168-0072(87)90038-8zbMath0617.03016OpenAlexW2050198215MaRDI QIDQ1821772
Publication date: 1987
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(87)90038-8
Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Categoricity and completeness of theories (03C35)
Related Items
Inseparability in recursive copies ⋮ Strong \(\Delta ^ 0_ 2\) categoricity ⋮ Degrees of autostability relative to strong constructivizations for Boolean algebras ⋮ Degrees of autostability for linear orders and linearly ordered abelian groups ⋮ A robuster Scott rank ⋮ Scott ranks of models of a theory ⋮ Back and forth relations for reduced abelian \(p\)-groups ⋮ Generic copies of countable structures ⋮ Degrees of categoricity for superatomic Boolean algebras ⋮ Strong degrees of categoricity and weak density ⋮ Pairs of recursive structures ⋮ Labelling systems and r.e. structures ⋮ The complexity of computable categoricity ⋮ Computability-theoretic categoricity and Scott families ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ Effective categoricity of equivalence structures ⋮ Degrees of autostability relative to strong constructivizations ⋮ Categoricity spectra of computable structures ⋮ Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension ⋮ Categoricity and complexity of relations over algebraic structures ⋮ The computable dimension of trees of infinite height ⋮ Computable categoricity of trees of finite height ⋮ Effective categoricity of abelian \(p\)-groups ⋮ COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ ⋮ On bi-embeddable categoricity of algebraic structures ⋮ Coding in the automorphism group of a computably categorical structure ⋮ On the $n$-back-and-forth types of Boolean algebras ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Enumerations in computable structure theory ⋮ Hyperarithmetical relations in expansions of recursive structures
Cites Work
- Unnamed Item
- Stability of recursive structures in arithmetical degrees
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Autostability and computable families of constructivizations
- The quantity of nonautoequivalent constructivizations
- Model theory
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
