scientific article; zbMATH DE number 4053608

MaRDI QIDQ3789557zbMATH OpenFDO

Authors Gaisi Takeuti

Publication date 1987

zbMATH Keywords

bounded arithmeticcut eliminationexistence of the exponential functionpolynomial time hierarchy

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Cut-elimination and normal-form theorems (03F05) Relative consistency and interpretations (03F25) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4059391
• scientific article; zbMATH DE number 218509
• Delineating classes of computational complexity via second order theories with weak set existence principles. I
• scientific article; zbMATH DE number 4066875
• Logical foundations of proof complexity

Cited in

(8)

• Algorithm analysis through proof complexity
• Hardness assumptions in the foundations of theoretical computer science
• Computational Complexity Via Finite Types
• scientific article; zbMATH DE number 424614 (Why is no real title available?)
• Proof Complexity and the Kneser-Lovász Theorem
• scientific article; zbMATH DE number 2161249 (Why is no real title available?)
• scientific article; zbMATH DE number 2212138 (Why is no real title available?)
• scientific article; zbMATH DE number 2212170 (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 Q3789557)