Non-bounding constructions

DOI10.1016/0168-0072(90)90048-7MaRDI QIDQ750428zbMATH OpenOpenAlexFDO

Authors Joseph 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)

Review text

The paper explains, in an illuminating way, a technical construction useful in priority proofs by isolating a common part of the proofs of two results due to Lachlan and Harrington.

Recommendations

• Iterated trees of strategies and priority arguments
• Priority constructions
• Relative constructivity
• A General Framework for Priority Arguments
• scientific article; zbMATH DE number 4004179

Cites work

• Bounding minimal pairs
• scientific article; zbMATH DE number 3914304 (Why is no real title available?)
• scientific article; zbMATH DE number 3784859 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)

Cited in

(5)

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

This page was built for publication: Non-bounding constructions

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