The following pages link to (Q3140642):
Displaying 5 items.
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- \(\text{Count}(q)\) does not imply \(\text{Count}(p)\) (Q1377601) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Structures interpretable in models of bounded arithmetic (Q2570136) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)