Labelling systems and r.e. structures

DOI10.1016/0168-0072(90)90065-AzbMATH Open0712.03021OpenAlexW1990814476MaRDI QIDQ923076FDOQ923076

Authors: 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

Recommendations

• Constructions by transfinitely many workers
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Priority constructions
• Mixed systems
• Requirement systems

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)

Cites Work

• Model theory
• Title not available (Why is that?)
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Jumps of Orderings
• Pairs of recursive structures
• Categoricity in hyperarithmetical degrees
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• Stability of recursive structures in arithmetical degrees

Cited In (21)

• Mixed systems
• A construction for recursive linear orderings
• Constructions by transfinitely many workers
• Degrees of categoricity on a cone via \(\eta\)-systems
• Sticker systems
• Hyperarithmetical relations in expansions of recursive structures
• Requirement systems
• Coding a family of sets
• Ramified systems
• 1994–1995 Winter Meeting of the Association for Symbolic Logic
• 1995 Annual Meeting of the Association for Symbol Logic
• Annual meeting of the Association for Symbolic Logic, Notre Dame, 1993
• Inseparability in recursive copies
• Iterated priority arguments in descriptive set theory
• A metatheorem for constructions by finitely many workers
• Incomparable prime ideals of recursively enumerable degrees
• Completeness of the hyperarithmetic isomorphism equivalence relation
• A General Framework for Priority Arguments
• The isomorphism problem for computable Abelian _p-groups of bounded length
• PRIORITY ARGUMENTS VIA TRUE STAGES
• The property ``arithmetic-is-recursive on a cone

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923076)