FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS

DOI10.1017/jsl.2016.23zbMath1403.03070arXiv1406.3646OpenAlexW2963890953MaRDI QIDQ2976331

Keng Meng Ng, Russell G. Miller

Publication date: 28 April 2017

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.3646

zbMATH Keywords

equivalence relationscomputabilityrecursion theorycomputable reducibilityfinitary reducibility

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

Computable transformations of structures ⋮ On the degree structure of equivalence relations under computable reducibility

Cites Work

• The effective theory of Borel equivalence relations
• On Σ¹ ₁ equivalence relations over the natural numbers
• Classification from a Computable Viewpoint
• Comparing Classes of Finite Structures
• Computably enumerable equivalence relations

This page was built for publication: FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS