The following pages link to Chris Pollett (Q535151):
Displaying 16 items.
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- Languages to diagonalize against advice classes (Q853646) (← links)
- Structure and definability in general bounded arithmetic theories (Q1125060) (← links)
- On the bounded version of Hilbert's tenth problem (Q1407606) (← links)
- Multifunction algebras and the provability of \(PH\downarrow\) (Q1577486) (← links)
- (Q1827393) (redirect page) (← links)
- Minimization and \(\mathbf{NP}\) multifunctions (Q1827394) (← links)
- Ordinal notations and well-orderings in bounded arithmetic (Q1861331) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- The weak pigeonhole principle for function classes inS12 (Q3418087) (← links)
- (Q4375798) (← links)
- (Q4487252) (← links)
- Strengths and Weaknesses of LH Arithmetic (Q4531087) (← links)
- A theory for Log-Space and NLIN versus co-NLIN (Q4650271) (← links)
- (Q4944913) (← links)
- On the finite axiomatizability of (Q5109206) (← links)
