Pages that link to "Item:Q3472099"
From MaRDI portal
The following pages link to Quantified propositional calculi and fragments of bounded arithmetic (Q3472099):
Displayed 28 items.
- Lifting lower bounds for tree-like proofs (Q475337) (← links)
- Preservation theorems and restricted consistency statements in bounded arithmetic (Q598285) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
- Bounded arithmetic and the polynomial hierarchy (Q1177041) (← links)
- On induction-free provability (Q1353982) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- On transformations of constant depth propositional proofs (Q2311211) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
- Tautologies from Pseudo-Random Generators (Q2736584) (← links)
- Simulating non-prenex cuts in quantified propositional calculus (Q3096088) (← links)
- Logical Closure Properties of Propositional Proof Systems (Q3502657) (← links)
- POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC (Q3583040) (← links)
- Examining Fragments of the Quantified Propositional Calculus (Q3617380) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Witnessing functions in bounded arithmetic and search problems (Q4227882) (← links)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
- On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP (Q5055954) (← links)
- On the finite axiomatizability of (Q5109206) (← links)
- Implicit proofs (Q5311729) (← links)
- Fragments of bounded arithmetic and the lengths of proofs (Q5502825) (← links)