Pages that link to "Item:Q1575637"
From MaRDI portal
The following pages link to Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637):
Displaying 5 items.
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- No feasible monotone interpolation for simple combinatorial reasoning (Q1575265) (← links)
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK (Q1577476) (← links)
- (Q4503949) (← links)
- The permutability of rules in the classical inferential calculus (Q5813906) (← links)