Isolation and the Jump Operator

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200111)47:4<525::AID-MALQ525>3.0.CO;2-7" /><525::AID-MALQ525>3.0.CO;2-7 10.1002/1521-3870(200111)47:4<525::AID-MALQ525>3.0.CO;2-7zbMath1003.03039OpenAlexW2070768514MaRDI QIDQ2765575

Guohua Wu

Publication date: 22 January 2003

Full work available at URL: https://doi.org/10.1002/1521-3870(200111)47:4<525::aid-malq525>3.0.co;2-7

zbMATH Keywords

isolationrecursively enumerable setsTuring degreeshigh degreeslow degreesd.r.e. degrees

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Related Items (4)

Bi-isolation in the d.c.e. degrees ⋮ Bounding computably enumerable degrees in the Ershov hierarchy ⋮ An almost-universal cupping degree ⋮ Nonisolated degrees and the jump operator

This page was built for publication: Isolation and the Jump Operator