Logical Foundations of Proof Complexity
From MaRDI portal
Publication:5410826
DOI10.1017/CBO9780511676277zbMath1284.03001WikidataQ29304563 ScholiaQ29304563MaRDI QIDQ5410826
No author found.
Publication date: 17 April 2014
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items (14)
The NP Search Problems of Frege and Extended Frege Proofs ⋮ Proof complexity of modal resolution ⋮ Iterated multiplication in \(VTC^0\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Improved witnessing and local improvement principles for second-order bounded arithmetic ⋮ Proof Complexity of Non-classical Logics ⋮ Propositional proof complexity ⋮ Consistency and Optimality ⋮ Definability of Recursive Predicates in the Induced Subgraph Order ⋮ ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD NP ∩ coNP FUNCTION ⋮ Simulating non-prenex cuts in quantified propositional calculus ⋮ The complexity of the comparator circuit value problem ⋮ Sprague-Grundy theory in bounded arithmetic
This page was built for publication: Logical Foundations of Proof Complexity
