The minimal e-degree problem in fragments of Peano arithmetic

DOI10.1016/j.apal.2004.04.010zbMath1068.03050OpenAlexW2045879934MaRDI QIDQ705537

Yue Yang, Marat M. Arslanov, Chi Tat Chong, S. Barry Cooper

Publication date: 31 January 2005

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2004.04.010

zbMATH Keywords

\(\Sigma_2\)-collectione-degreesfragments of arithemtic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The degree of a \(\Sigma_ n\) cut
• On degrees of recursive unsolvability
• \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator
• A minimal degree less than 0’
• Σ₂-collection and the infinite injury priority method
• ∑ n Definable Sets without ∑ n Induction
• Partial degrees and the density problem
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction

This page was built for publication: The minimal e-degree problem in fragments of Peano arithmetic