Undecidability of local structures of s-degrees and Q-degrees

zbMath1158.03028MaRDI QIDQ1009444

Thomas F. Kent, Maria Libera Affatato, Andrea Sorbi

Publication date: 1 April 2009

Published in: Tbilisi Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

undecidability; enumeration reducibility; Q-reducibility; s-reducibility

Mathematics Subject Classification ID

03D35: Undecidability and degrees of sets of sentences

03D25: Recursively (computably) enumerable sets and degrees

03D30: Other degrees and reducibilities in computability and recursion theory

Related Items

Irreducible, singular, and contiguous degrees, \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets