scientific article; zbMATH DE number 1420835

MaRDI QIDQ4944903zbMATH OpenFDO

Authors Lev D. Beklemishev

Publication date 5 September 2000

zbMATH Keywords

primitive recursive arithmeticprimitive recursive well-orderingtransfinite induction

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) First-order arithmetic and fragments (03F30)

Recommendations

• Arithmetic transfinite induction and recursive well-orderings
• A non-well-founded primitive recursive tree provably well-founded for co-r. e. sets
• Variation on a theme of Schütte
• Transfinite induction within Peano arithmetic
• Proof-theoretic strengths of the well-ordering principles

Cited in

(6)

• A non-well-founded primitive recursive tree provably well-founded for co-r. e. sets
• Reverse mathematics and Peano categoricity
• Deducibility and independence in Beklemishev's autonomous provability calculus
• Variation on a theme of Schütte
• On the hierarchy of natural theories
• Automatic structures and the problem of natural well-orderings

This page was built for publication:

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