Measuring the complexity of reductions between equivalence relations

DOI10.3233/COM-180100zbMath1454.03056arXiv1806.10363OpenAlexW3104946751WikidataQ129144536 ScholiaQ129144536MaRDI QIDQ5211066

Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Publication date: 17 January 2020

Published in: Computability (Search for Journal in Brave)

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

zbMATH Keywords

reducibilityequivalence relationscomputably enumerable equivalence relationscomputable structure theoryreducibility degree spectra

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Related Items (4)

ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS ⋮ Word problems and ceers ⋮ Classifying equivalence relations in the Ershov hierarchy ⋮ Computing sets from all infinite subsets

This page was built for publication: Measuring the complexity of reductions between equivalence relations