Pages that link to "Item:Q1006613"
From MaRDI portal
The following pages link to On lengths of proofs in non-classical logics (Q1006613):
Displaying 9 items.
- Proof complexity of intuitionistic implicational formulas (Q331054) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Proof complexity of propositional default logic (Q647339) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Proof complexity of substructural logics (Q2032997) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
- Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss (Q4646655) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
