The following pages link to (Q5111329):
Displaying 4 items.
- Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination (Q4337947) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem (Q5204803) (← links)
- Exponentially handsome proof nets and their normalization (Q6657781) (← links)