The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent

zbMath1089.03033MaRDI QIDQ2386567

Richard A. Shore

Publication date: 30 August 2005

Published in: Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

computably enumerable degreesTuring degreesrecursively enumerable degreesjump classes

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Hierarchies of computability and definability (03D55)

Related Items (1)

Elementary differences among jump classes

This page was built for publication: The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent