scientific article; zbMATH DE number 1070621
From MaRDI portal
Publication:4357061
zbMath0882.68130MaRDI QIDQ4357061
Publication date: 7 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Pure extensions, proof rules, and hybrid axiomatics ⋮ Collapsing modular counting in bounded arithmetic and constant depth propositional proofs ⋮ NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN ⋮ Towards NP-P via proof complexity and search ⋮ Mining the surface: witnessing the low complexity theorems of arithmetic ⋮ The scope of Gödel's first incompleteness theorem ⋮ Partially definable forcing and bounded arithmetic ⋮ Feasibly constructive proofs of succinct weak circuit lower bounds ⋮ Expressivity of second order propositional modal logic ⋮ Polynomial time ultrapowers and the consistency of circuit lower bounds
This page was built for publication:
