scientific article; zbMATH DE number 1231647

MaRDI QIDQ4222972zbMATH OpenFDO

Authors Ulrich Kohlenbach

Publication date 6 January 1999

Full work available at URL http://www.elsevier.com/cas/tree/store/tcs/free/entcs/store/contents.htt?jrnl=tcs&sctn=entcs&mode=sub&vol=1313011

zbMATH Keywords

hereditarily polynomial bounded analysis

Mathematics Subject Classification ID

Recommendations

• New Computational Paradigms
• scientific article; zbMATH DE number 1222925
• Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
• A complexity analysis of functional interpretations
• Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization

Cited in

(13)

• Computer-assisted proofs in analysis
• Things that can and things that cannot be done in PRA
• Proof theory and ordinal analysis
• A proof-theoretic bound extraction theorem for \(\mathrm{CAT}(\kappa)\)-spaces
• Bounded functional interpretation
• Theorem proving method and the computer science
• scientific article; zbMATH DE number 5899421 (Why is no real title available?)
• scientific article; zbMATH DE number 424614 (Why is no real title available?)
• Light monotone Dialectica methods for proof mining
• scientific article; zbMATH DE number 5652610 (Why is no real title available?)
• scientific article; zbMATH DE number 4092761 (Why is no real title available?)
• Techniques of computable set theory with applications to proof verification
• scientific article; zbMATH DE number 5269066 (Why is no real title available?)

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