scientific article; zbMATH DE number 3845569

zbMATH Open0533.03025MaRDI QIDQ3315501FDOQ3315501

Authors: Klaus Ambos-Spies 

Publication date: 1982

Title of this publication is not available (Why is that?)

Recommendations

• On Pairs of Recursively Enumerable Degrees
• Splittings of 0' into the Recursively Enumerable Degrees
• Generalized nonsplitting in the recursively enumerable degrees
• The density of infima in the recursively enumerable degrees
• Minimal pairs in initial segments of the recursively enumerable degrees

zbMATH Keywords

upper semilatticepairs of incomparable recursively enumerable degrees

Mathematics Subject Classification ID

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

Cited In (11)

• The recursively enumerable degrees have infinitely many one-types
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• On the theory of the PTIME degrees of the recursive sets
• Cappable recursively enumerable degrees and Post's program
• Working below a high recursively enumerable degree
• Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets
• On Pairs of Recursively Enumerable Degrees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposition and infima in the computably enumerable degrees
• A hierarchy of families of recursively enumerable degrees

This page was built for publication:

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