The degree of a _ n cut

DOI10.1016/0168-0072(90)90021-SzbMATH Open0713.03028OpenAlexW2055041806MaRDI QIDQ749530FDOQ749530

Authors: D. Kharzeev 

Publication date: 1990

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(90)90021-s

Recommendations

• The jump of a Σ _n -cut
• The minimal e-degree problem in fragments of Peano arithmetic
• Recursion theory on weak fragments of Peano arithmetic: A study of definable cuts
• scientific article; zbMATH DE number 1420838
• ∑ n Definable Sets without ∑ n Induction

zbMATH Keywords

minimal degreesminimal pairsreverse recursion theory

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) First-order arithmetic and fragments (03F30)

Cites Work

• A note on the Mac Dowell-Specker theorem
• Title not available (Why is that?)
• Σ₂-collection and the infinite injury priority method
• Finite injury and Σ₁-induction
• Title not available (Why is that?)
• Hyperhypersimple sets and \(\Delta _ 2\) systems
• Title not available (Why is that?)

Cited In (13)

• Title not available (Why is that?)
• In search of the first-order part of Ramsey's theorem for pairs
• The minimal e-degree problem in fragments of Peano arithmetic
• Weaker cousins of Ramsey's theorem over a weak base theory
• Σ₂ Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator
• \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator
• The jump of a Σ _n -cut
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction
• 1-Generic Degrees Bounding Minimal Degrees Revisited
• Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory
• HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?
• The inductive strength of Ramsey's theorem for pairs

This page was built for publication: The degree of a \(\Sigma_ n\) cut

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