The following pages link to (Q4440824):
Displaying 6 items.
- Normalization of N-graphs via sub-N-graphs (Q1744401) (← links)
- On strong normalization in proof-graphs for propositional logic (Q1744419) (← links)
- Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination (Q4337947) (← links)
- (Q4530463) (← links)
- (Q4575567) (← links)
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants (Q4917988) (← links)