The low_n and low_m r.e. degrees are not elementarily equivalent

MaRDI QIDQ2386567zbMATH OpenFDO

Authors Richard A. Shore

Publication date 30 August 2005

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

zbMATH Keywords

Turing degreescomputably enumerable degreesrecursively enumerable degreesjump classes

Mathematics Subject Classification ID

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

Recommendations

• Publication:3491535
• A join theorem for the computably enumerable degrees
• Some Special Pairs of Σ2 e-Degrees
• scientific article; zbMATH DE number 1752644
• Infima in the d.r.e. degrees

Cited in

(3)

• scientific article; zbMATH DE number 1523417 (Why is no real title available?)
• There are no maximal low d.c.e. degrees
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386567)