scientific article; zbMATH DE number 4099295

MaRDI QIDQ3824312zbMATH OpenFDO

Authors Wilfried Sieg

Publication date 1987

zbMATH Keywords

comprehensionconservativityprimitive recursive arithmeticprovably recursive functionalssecond-order arithmeticweak Koenig's lemma

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• A feasible theory for analysis
• Provably recursive functions of constructive and relatively constructive theories
• König's lemma, the ω-Rule and primitive recursive arithmetic
• Interpreting weak Kőnig's lemma in theories of nonstandard arithmetic
• Provably recursive functions in fragments of Peano arithmetic

Cited in

(9)

• The lack of definable witnesses and provably recursive functions in intuitionistic set theories
• Things that can and things that cannot be done in PRA
• Herbrand analyses
• Comparing the strength of diagonally nonrecursive functions in the absence of _2⁰ induction
• König's lemma, the ω-Rule and primitive recursive arithmetic
• A feasible theory for analysis
• Primitive recursion and the chain antichain principle
• On the proof theory of type two functionals based on primitive recursive operations
• Provably recursive functions of constructive and relatively constructive theories

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 Q3824312)