Coding a family of sets

DOI10.1016/S0168-0072(97)00070-5zbMath0924.03083MaRDI QIDQ1295408

Julia F. Knight

Publication date: 8 November 1999

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

zbMATH Keywords

codinglimit pointsrecursive ordering

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Related Items (2)

Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures ⋮ Degree Spectra of Relations on a Cone

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-bounding constructions
• Labelling systems and r.e. structures
• Stability of recursive structures in arithmetical degrees
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• Some effects of Ash-Nerode and other decidability conditions on degree spectra
• Ramified systems
• Possible degrees in recursive copies. II
• Computable structures and the hyperarithmetical hierarchy
• Possible degrees in recursive copies
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Relatively recursive expansions
• Mixed systems
• A General Framework for Priority Arguments
• The Sacks density theorem and Σ₂-bounding

This page was built for publication: Coding a family of sets