_ 2 induction and infinite injury priority arguments. II. Tame _ 2 coding and the jump operator

DOI10.1016/0168-0072(96)00028-0MaRDI QIDQ1368581zbMATH OpenOpenAlexFDO

Authors Yue Yang, C. T. 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

blockingtame relationrecursively enumerable degreejump operator\(\Sigma_ 2\)-collection\(\Sigma_ 2\)-induction

Mathematics Subject Classification ID

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

Recommendations

• Σ₂ Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator
• Publication:3483271
• Σ₂-collection and the infinite injury priority method
• \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture

Cites work

• scientific article; zbMATH DE number 3689386 (Why is no real title available?)
• Finite injury and Σ₁-induction
• On suborderings of the α-recursively enumerable α-degrees
• On the Jump of an α-Recursively Enumerable Set
• Recursively enumerable sets and degrees
• Splitting an α-Recursively Enumerable Set
• The Sacks density theorem and Σ₂-bounding
• The degree of a \(\Sigma_ n\) cut
• Σ₂ Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator
• ∑ n Definable Sets without ∑ n Induction

Cited in

(9)

• scientific article; zbMATH DE number 1421082 (Why is no real title available?)
• scientific article; zbMATH DE number 4154426 (Why is no real title available?)
• The minimal e-degree problem in fragments of Peano arithmetic
• Σ₂-collection and the infinite injury priority method
• Comparing the strength of diagonally nonrecursive functions in the absence of \(\Sigma_2^0\) induction
• scientific article; zbMATH DE number 4150148 (Why is no real title available?)
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
• \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture

This page was built for publication: \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator

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