Labelling systems and r.e. structures

DOI10.1016/0168-0072(90)90065-AzbMath0712.03021MaRDI QIDQ923076

C. J. Ash

Publication date: 1990

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

\(\alpha \) -systems; labelling systems; recursively enumerable structures

Mathematics Subject Classification ID

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures

Related Items

Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993, Mixed systems, Requirement systems, A General Framework for Priority Arguments, 1994–1995 Winter Meeting of the Association for Symbolic Logic, 1995 Annual Meeting of the Association for Symbol Logic, Incomparable prime ideals of recursively enumerable degrees, Coding a family of sets, Hyperarithmetical relations in expansions of recursive structures, Inseparability in recursive copies, Ramified systems, The isomorphism problem for computable Abelian _p-groups of bounded length, A construction for recursive linear orderings

Cites Work

• Unnamed Item
• Pairs of recursive structures
• Stability of recursive structures in arithmetical degrees
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• Model theory
• Categoricity in hyperarithmetical degrees
• Jumps of Orderings
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees