Agreement reducibility

DOI10.1002/MALQ.201900088MaRDI QIDQ6047663zbMATH OpenOpenAlexFDO

Authors Rachel Epstein, Karen Lange

Publication date 12 September 2023

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.201900088

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• Reducibility on families
• scientific article; zbMATH DE number 5049507
• scientific article; zbMATH DE number 701112
• Finitary reducibility on equivalence relations
• scientific article; zbMATH DE number 4053594

Cites work

• \(Q _{1}\)-degrees of c.e. sets
• A characterization of the δ₂⁰ hyperhyperimmune sets
• Algorithmic randomness and complexity.
• Bounded enumeration reducibility and its degree structure
• Classification from a Computable Viewpoint
• Classifying positive equivalence relations
• Comparing Classes of Finite Structures
• Computability and randomness
• Computably enumerable equivalence relations
• Equivalence Relations on Classes of Computable Structures
• scientific article; zbMATH DE number 4160710 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3587017 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Hyperhypersimple sets and \(\mathrm{Q}_{1}\)-reducibility
• Immunity properties and strong positive reducibilities
• Immunity properties of the s-degrees
• Isomorphism relations on computable structures
• Jump equivalence of the Δ₂⁰ hyperimmune sets
• Lowness for genericity
• On Σ¹ ₁ equivalence relations over the natural numbers
• Reducibility and Completeness for Sets of Integers
• Some properties of maximal sets
• The axiomatization of randomness
• The effective theory of Borel equivalence relations
• The hierarchy of equivalence relations on the natural numbers under computable reducibility
• Turing computable embeddings
• Universal computably enumerable equivalence relations

Cited in

(1)

• scientific article; zbMATH DE number 1974601 (Why is no real title available?)

This page was built for publication: Agreement reducibility

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