The following pages link to (Q3140644):
Displayed 13 items.
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- The equivalence of theories that characterize ALogTime (Q834715) (← links)
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly (Q937909) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- A note on sharply bounded arithmetic (Q1325055) (← links)
- RSUV isomorphisms for TAC\(^ i\), TNC\(^ i\) and \(TLS\) (Q1345903) (← links)
- End extensions of models of linearly bounded arithmetic (Q1377910) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- Multifunction algebras and the provability of \(PH\downarrow\) (Q1577486) (← links)
- Separations of first and second order theories in bounded arithmetic (Q2388431) (← links)
- Models of replacement schemes (Q2573725) (← links)
- A theory for Log-Space and NLIN versus co-NLIN (Q4650271) (← links)