The following pages link to (Q5391544):
Displaying 6 items.
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Hard examples for the bounded depth Frege proof system (Q1430570) (← links)
- A bounded arithmetic AID for Frege systems (Q1977488) (← links)
- Inference of bounded L systems with polymorphic P systems (Q2299882) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- Polynomially and superexponentially shorter proofs in fragments of arithmetic (Q4032866) (← links)