scientific article; zbMATH DE number 1354169

MaRDI QIDQ4268484zbMATH OpenFDO

Authors Jan Krajíček, Pavel Pudlák

Publication date 28 October 1999

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Cited in

(5)

• Arithmetizing uniform NC
• Feasibly constructive proofs of succinct weak circuit lower bounds
• On the correspondence between arithmetic theories and propositional proof systems – a survey
• On the unprovability of circuit size bounds in intuitionistic \(\mathsf{S}^1_2\)
• On \(\mathrm{NP} \cap \mathrm{coNP}\) proof complexity generators

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