The following pages link to Proofs without syntax (Q2469641):
Displaying 21 items.
- Classical proof forestry (Q636369) (← links)
- A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs (Q964500) (← links)
- A semantic framework for proof evidence (Q1701039) (← links)
- From syntactic proofs to combinatorial proofs (Q1799109) (← links)
- Streams and strings in formal proofs. (Q1853510) (← links)
- Proof nets for classical logic (Q1982017) (← links)
- The explosion calculus (Q2186694) (← links)
- Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination (Q4337947) (← links)
- (Q4435042) (← links)
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants (Q4917988) (← links)
- (Q5018489) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- (Q5089024) (← 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)
- Discussing Hilbert's 24th problem (Q5204805) (← links)
- The Role of Structural Reasoning in the Genesis of Graph Theory (Q5208125) (← links)
- Complementary proof nets for classical logic (Q6146288) (← links)
- Canonicity of proofs in constructive modal logic (Q6541161) (← links)
- Truth diagrams for some non-classical and modal logics (Q6650730) (← links)
- Exponentially handsome proof nets and their normalization (Q6657781) (← links)