Pages that link to "Item:Q5502825"
From MaRDI portal
The following pages link to Fragments of bounded arithmetic and the lengths of proofs (Q5502825):
Displaying 15 items.
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- The provably total NP search problems of weak second order bounded arithmetic (Q639650) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← links)
- Tractable fragments of Presburger arithmetic (Q814932) (← links)
- Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic (Q866557) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- Quantified propositional calculi and fragments of bounded arithmetic (Q3472099) (← links)
- (Q3476809) (← links)
- POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC (Q3583040) (← links)
- Approximation and Small-Depth Frege Proofs (Q4027856) (← links)
- Polynomially and superexponentially shorter proofs in fragments of arithmetic (Q4032866) (← links)
- (Q5213547) (← links)
- (Q5465358) (← links)
- (Q5488131) (← links)
