scientific article; zbMATH DE number 922617
From MaRDI portal
Publication:4893137
zbMath0857.03023MaRDI QIDQ4893137
Publication date: 1 September 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitybounded arithmeticformal systemspropositional calculusweak theorieslengths of proofs
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Complexity of proofs (03F20)
Related Items (2)
Typical forcings, NP search problems and an extension of a theorem of Riis ⋮ Partially definable forcing and bounded arithmetic
This page was built for publication: