Equivalence Relations That Are $\Sigma^0_3$ Complete for Computable Reducibility

DOI10.1007/978-3-642-32621-9_2zbMath1362.03032OpenAlexW28553087MaRDI QIDQ2915014

André Nies, Ekaterina B. Fokina, Sy-David Friedman

Publication date: 21 September 2012

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32621-9_2

zbMATH Keywords

computable structuresinvariant descriptive set theory

Mathematics Subject Classification ID

Descriptive set theory (03E15) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57)

Related Items (6)

Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Jumps of computably enumerable equivalence relations ⋮ A Survey on Universal Computably Enumerable Equivalence Relations ⋮ Minimal equivalence relations in hyperarithmetical and analytical hierarchies ⋮ Enumerating classes of effective quasi-Polish spaces ⋮ Computable embeddability for algebraic structures

This page was built for publication: Equivalence Relations That Are $\Sigma^0_3$ Complete for Computable Reducibility