Categoricity in hyperarithmetical degrees

DOI10.1016/0168-0072(87)90038-8zbMath0617.03016MaRDI QIDQ1821772

C. J. Ash

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

zbMATH Keywords

superatomic Boolean algebras; recursive structure

Mathematics Subject Classification ID

03D30: Other degrees and reducibilities in computability and recursion theory

03C57: Computable structure theory, computable model theory

03C35: Categoricity and completeness of theories

Related Items

DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS, 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 complexity of computable categoricity, Pairs of recursive structures, Labelling systems and r.e. structures, Effective categoricity of abelian \(p\)-groups, Strong \(\Delta ^ 0_ 2\) categoricity, Generic copies of countable structures, Computable isomorphisms, degree spectra of relations, and Scott families, Hyperarithmetical relations in expansions of recursive structures, Inseparability in recursive copies, Scott ranks of models of a theory, Computability-theoretic categoricity and Scott families, Back and forth relations for reduced abelian \(p\)-groups, Degrees of autostability relative to strong constructivizations for Boolean algebras, Degrees of autostability for linear orders and linearly ordered abelian groups, Degrees of categoricity for superatomic Boolean algebras, Effective categoricity of equivalence structures, Degrees of autostability relative to strong constructivizations, Enumerations in computable structure theory, 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10, COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$, On the $n$-back-and-forth types of Boolean algebras, The computable dimension of trees of infinite height, Computable categoricity of trees of finite height, A robuster Scott rank

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