Pages that link to "Item:Q1799109"
From MaRDI portal
The following pages link to From syntactic proofs to combinatorial proofs (Q1799109):
Displaying 9 items.
- Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) (Q832157) (← links)
- A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs (Q964500) (← links)
- Proof nets for classical logic (Q1982017) (← links)
- Recursive proof composition from accumulation schemes (Q2119035) (← links)
- Proofs without syntax (Q2469641) (← links)
- Identity of Proofs Based on Normalization and Generality (Q4650310) (← links)
- Combinatorial flows and their normalisation (Q5111329) (← 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)