The following pages link to Lower bounds for modal logics (Q5422311):
Displayed 8 items.
- Proof complexity of intuitionistic implicational formulas (Q331054) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- A lower bound for intuitionistic logic (Q876385) (← links)
- On lengths of proofs in non-classical logics (Q1006613) (← links)
- Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)