\(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture

DOI10.1007/BF02802493zbMath0976.03049OpenAlexW1996445289WikidataQ123360730 ScholiaQ123360730MaRDI QIDQ5937666

Yue Yang, Chi Tat Chong, Theodore A. Slaman, Lei Quian

Publication date: 31 July 2001

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02802493

zbMATH Keywords

minimal pairs\(\Sigma_2\) collection\(\Sigma_2\) induction\(B\Sigma_2\) modelrecursively enumerable

Mathematics Subject Classification ID

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

Related Items

NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS, COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator
• Complementation in the Turing degrees
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Σ₂-collection and the infinite injury priority method
• Finite injury and Σ₁-induction
• Branching Degrees above low Degrees
• ∑ n Definable Sets without ∑ n Induction
• Σ₂ Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator
• The Sacks density theorem and Σ₂-bounding
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees