Pages that link to "Item:Q1899144"
From MaRDI portal
The following pages link to Relating the bounded arithmetic and polynomial time hierarchies (Q1899144):
Displaying 12 items.
- 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)
- End extensions of models of linearly bounded arithmetic (Q1377910) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- A model-theoretic characterization of the weak pigeonhole principle (Q1849868) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- Separations of first and second order theories in bounded arithmetic (Q2388431) (← links)
- 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 (Q2732529) (← links)
- Truth definitions without exponentiation and the Σ<sub>1</sub> collection scheme (Q2892683) (← links)
- Approximate counting by hashing in bounded arithmetic (Q3399180) (← links)
- Approximate counting in bounded arithmetic (Q5422312) (← links)
- Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> (Q5444705) (← links)
