Pages that link to "Item:Q5687325"
From MaRDI portal
The following pages link to Notes on polynomially bounded arithmetic (Q5687325):
Displaying 39 items.
- Relativizing small complexity classes and their theories (Q260396) (← links)
- Preservation theorems and restricted consistency statements in bounded arithmetic (Q598285) (← links)
- On theories of bounded arithmetic for \(\mathrm{NC}^1\) (Q638497) (← links)
- The provably total NP search problems of weak second order bounded arithmetic (Q639650) (← links)
- The strength of extensionality. II: Weak weak set theories without infinity (Q639665) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA (Q711565) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- The equivalence of theories that characterize ALogTime (Q834715) (← links)
- Generalized quantifier and a bounded arithmetic theory for LOGCFL (Q884960) (← links)
- Algorithmically independent sequences (Q964004) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← 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)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Weak theories of linear algebra (Q1766923) (← links)
- A model-theoretic characterization of the weak pigeonhole principle (Q1849868) (← links)
- Saturated models of universal theories (Q1861531) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
- Iterated multiplication in \(VTC^0\) (Q2155497) (← links)
- Polynomial time ultrapowers and the consistency of circuit lower bounds (Q2288334) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
- Separations of first and second order theories in bounded arithmetic (Q2388431) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- Local induction and provably total computable functions (Q2453069) (← links)
- Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) (Q2700809) (← links)
- The polynomial and linear time hierarchies in V<sup>0</sup> (Q3184215) (← links)
- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (Q3540180) (← links)
- A note on the Σ<sub>1</sub>collection scheme and fragments of bounded arithmetic (Q3552388) (← links)
- POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC (Q3583040) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- 2000 Annual Meeting of the Association for Symbolic Logic (Q4527937) (← links)
- STRICT FINITISM, FEASIBILITY, AND THE SORITES (Q4577997) (← links)
- ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM (Q5107534) (← links)
- A model of \(\widehat{R}^2_3\) inside a subexponential time resource (Q5937822) (← links)
- On Herbrand's theorem (Q6064282) (← links)
- Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts (Q6096734) (← links)
