An extended Lachlan splitting theorem

DOI10.1016/0168-0072(95)00039-9MaRDI QIDQ1919538zbMATH OpenOpenAlexFDO

Authors 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 pairpriority argumentrecursively enumerable degreestop of a 1-diamondtop of an \(n\)-diamond

Mathematics Subject Classification ID

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

Recommendations

• Splittings of 0' into the Recursively Enumerable Degrees
• D.R.E. Degrees and the Nondiamond Theorem
• scientific article; zbMATH DE number 3845569
• scientific article; zbMATH DE number 3845570

Cites work

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

Cited in

(7)

• A parametric version of Forstnerič's splitting lemma
• A splitting theorem for blocks
• A generalization of the Lorentzian splitting theorem
• scientific article; zbMATH DE number 3845570 (Why is no real title available?)
• On Zimmermann-Huisgen's Splitting Theorem
• scientific article; zbMATH DE number 1101532 (Why is no real title available?)
• New Computational Paradigms

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

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