Pages that link to "Item:Q876385"
From MaRDI portal
The following pages link to A lower bound for intuitionistic logic (Q876385):
Displaying 13 items.
- Proof complexity of intuitionistic implicational formulas (Q331054) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- On lengths of proofs in non-classical logics (Q1006613) (← links)
- Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Proof complexity of substructural logics (Q2032997) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\) (Q2344720) (← links)
- (Q3444802) (← links)
- Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies (Q3613770) (← links)
- Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss (Q4646655) (← links)
- Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer) (Q5277900) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)