Pages that link to "Item:Q4337947"
From MaRDI portal
The following pages link to Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination (Q4337947):
Displaying 8 items.
- Interpolants, cut elimination and flow graphs for the propositional calculus (Q674415) (← links)
- Turning cycles into spirals (Q1295442) (← links)
- Normalization of N-graphs via sub-N-graphs (Q1744401) (← links)
- Streams and strings in formal proofs. (Q1853510) (← links)
- Radical anti-realism, Wittgenstein and the length of proofs (Q2268776) (← links)
- The cost of a cycle is a square (Q4532599) (← links)
- Cycling in proofs and feasibility (Q4942870) (← links)
- Asymptotic cyclic expansion and bridge groups of formal proofs (Q5945614) (← links)