\(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator

DOI10.1016/0168-0072(96)00028-0zbMath0881.03023OpenAlexW2017850155MaRDI QIDQ1368581

Yue Yang, Chi Tat Chong

Publication date: 26 January 1998

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(96)00028-0

zbMATH Keywords

recursively enumerable degreeblockingtame relationjump operator\(\Sigma_ 2\)-collection\(\Sigma_ 2\)-induction

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62) Recursively (computably) enumerable sets and degrees (03D25)

Related Items

\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs, On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics, \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture, The minimal e-degree problem in fragments of Peano arithmetic, COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION

Cites Work

• Unnamed Item
• The degree of a \(\Sigma_ n\) cut
• Finite injury and Σ₁-induction
• ∑ n Definable Sets without ∑ n Induction
• Splitting an α-Recursively Enumerable Set
• On the Jump of an α-Recursively Enumerable Set
• Recursively enumerable sets and degrees
• Σ₂ Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator
• The Sacks density theorem and Σ₂-bounding
• On suborderings of the α-recursively enumerable α-degrees