Pages that link to "Item:Q672046"
From MaRDI portal
The following pages link to Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046):
Displaying 7 items.
- No feasible monotone interpolation for simple combinatorial reasoning (Q1575265) (← links)
- Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637) (← links)
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK (Q1577476) (← links)
- Formula simplification via invariance detection by algebraically indexed types (Q2104529) (← links)
- On the Power of Substitution in the Calculus of Structures (Q2946759) (← links)
- 2000 Annual Meeting of the Association for Symbolic Logic (Q4527937) (← links)
- Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1 (Q5145435) (← links)