The following pages link to (Q5013887):
Displaying 8 items.
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- Complexity of subclasses of the intuitionistic propositional calculus (Q688732) (← links)
- Existence of simple propositional formulas (Q917333) (← links)
- A unified procedure for provability and counter-model generation in minimal implicational logic (Q2397231) (← links)
- (Q3505074) (← links)
- From the subformula property to cut-admissibility in propositional sequent calculi (Q4612444) (← links)
- (Q4729773) (← links)
- Substitution and Propositional Proof Complexity (Q5027247) (← links)