An extended Lachlan splitting theorem

DOI10.1016/0168-0072(95)00039-9zbMath0858.03046OpenAlexW2054567792MaRDI QIDQ1919538

Steffen Lempp, Yuefei Sui

Publication date: 23 July 1996

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(95)00039-9

zbMATH Keywords

minimal pairrecursively enumerable degreespriority argumenttop of a 1-diamondtop of an \(n\)-diamond

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Wtt-degrees and T-degrees of r.e. sets
• Decomposition of Recursively Enumerable Degrees
• The weak truth table degrees of recursively enumerable sets
• Highness and bounding minimal pairs
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees

This page was built for publication: An extended Lachlan splitting theorem