Non-bounding constructions

DOI10.1016/0168-0072(90)90048-7zbMath0714.03035OpenAlexW2066343882MaRDI QIDQ750428

J. R. Shoenfield

Publication date: 1990

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(90)90048-7

zbMATH Keywords

priority method

Mathematics Subject Classification ID

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

Related Items (5)

Priority constructions ⋮ A General Framework for Priority Arguments ⋮ Coding a family of sets ⋮ On the existence of a strong minimal pair ⋮ There is no plus-capping degree

Cites Work

• Bounding minimal pairs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-bounding constructions