Labelling systems and r.e. structures

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

C. J. Ash

Publication date: 1990

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(90)90065-a

zbMATH Keywords

\(\alpha \) -systemslabelling systemsrecursively enumerable structures

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (17)

Inseparability in recursive copies ⋮ Ramified systems ⋮ Completeness of the hyperarithmetic isomorphism equivalence relation ⋮ A construction for recursive linear orderings ⋮ Requirement systems ⋮ Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993 ⋮ A General Framework for Priority Arguments ⋮ Mixed systems ⋮ 1994–1995 Winter Meeting of the Association for Symbolic Logic ⋮ 1995 Annual Meeting of the Association for Symbol Logic ⋮ The property “arithmetic-is-recursive” on a cone ⋮ Incomparable prime ideals of recursively enumerable degrees ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ PRIORITY ARGUMENTS VIA TRUE STAGES ⋮ The isomorphism problem for computable Abelian _p-groups of bounded length ⋮ Coding a family of sets ⋮ Hyperarithmetical relations in expansions of recursive structures

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

This page was built for publication: Labelling systems and r.e. structures