Coding a family of sets

DOI10.1016/S0168-0072(97)00070-5MaRDI QIDQ1295408zbMATH OpenFDO

Authors J. F. Knight

Publication date 8 November 1999

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

Full work available at URL https://doi.org/10.1016/S0168-0072(97)00070-5

zbMATH Keywords

codinglimit pointsrecursive ordering

Mathematics Subject Classification ID

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

Review text

A metatheorem for coding a family of sets into a family of relations (or, into a sole relation) is obtained. As an application one proves that the set of limit points in a recursive ordering of type \(\omega^2\) can have arbitrary 2-REA degree.

Recommendations

• A note on set families and codes.
• scientific article; zbMATH DE number 59573
• Coding in the partial order of enumerable sets
• An Application of Set Theory to Coding Theory
• Coding into Ramsey sets
• ENCODINGS OF MULTISETS
• scientific article; zbMATH DE number 3878929
• A coding problem for pairs of subsets
• Codes from difference sets
• Coding partitions of regular sets

Cites work

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

Cited in

(6)

• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Coding into Ramsey sets
• How Many Figure Sets Are Codes?
• scientific article; zbMATH DE number 3920534 (Why is no real title available?)
• Degree spectra of relations on a cone
• Brick codes: families, properties, relations

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

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