Quantified propositional calculi and fragments of bounded arithmetic - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Jan Krajícek, Pavel Pudlák. Quantified propositional calculi and fragments of bounded arithmetic. Math. Log. Q., 36(1):29-46, 1990. [doi]

The following publications are possibly variants of this publication:

Fragments of bounded arithmetic and the lengths of proofsPavel Pudlák. JSYML, 73(4):1389-1406, 2008. [doi]

Bounded arithmetic, propositional logic, and complexity theoryJan Krajícek. Volume 60 of Encyclopedia of mathematics and its applications, Cambridge University Press, 1995.

NP search problems in low fragments of bounded arithmeticJan Krajícek, Alan Skelley, Neil Thapen. JSYML, 72(2):649-672, 2007. [doi]

runs on WebDSL