scientific article; zbMATH DE number 922617

MaRDI QIDQ4893137zbMATH OpenFDO

Authors Pavel Pudlák

Publication date 1 September 1996

zbMATH Keywords

bounded arithmeticcomputational complexityformal systemslengths of proofspropositional calculusweak theories

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30)

Cited in

(8)

• Normal functors, power series and -calculus
• Partially definable forcing and bounded arithmetic
• Typical forcings, NP search problems and an extension of a theorem of Riis
• Elementary complexity and geometry of interaction
• scientific article; zbMATH DE number 440481 (Why is no real title available?)
• Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
• The Complexity of Propositional Proofs
• scientific article; zbMATH DE number 969493 (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 Q4893137)