Pages that link to "Item:Q2032997"
From MaRDI portal
The following pages link to Proof complexity of substructural logics (Q2032997):
Displaying 14 items.
- Proof complexity of intuitionistic implicational formulas (Q331054) (← links)
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- Complexity of subclasses of the intuitionistic propositional calculus (Q688732) (← links)
- A lower bound for intuitionistic logic (Q876385) (← links)
- Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
- Off-line parsability and the well-foundedness of subsumption (Q1285865) (← links)
- On the proof complexity of logics of bounded branching (Q2084964) (← links)
- (Q3505074) (← links)
- (Q4263808) (← links)
- Substitution and Propositional Proof Complexity (Q5027247) (← links)
- (Q5144688) (← links)
- Substructural logic and partial correctness (Q5267434) (← links)
- (Q5854675) (← links)
- Complexity of the universal theory of residuated ordered groupoids (Q6169326) (← links)