The jump of a Σ n -cut

DOI10.1112/JLMS/JDM016zbMath1123.03038OpenAlexW1966222713MaRDI QIDQ5308178

Yue Yang, Chi Tat Chong

Publication date: 27 September 2007

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/jdm016

zbMATH Keywords

inductionproof-theoretic strengthfragments of Peano arithmeticTuring degreesjump classes

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Other Turing degree structures (03D28)

Related Items (5)

On the strength of Ramsey's theorem for trees ⋮ Primitive recursive reverse mathematics ⋮ 1-Generic Degrees Bounding Minimal Degrees Revisited ⋮ \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction ⋮ Weaker cousins of Ramsey's theorem over a weak base theory

This page was built for publication: The jump of a Σ _n -cut