Exponentially handsome proof nets and their normalization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4099289 (Why is no real title available?)
- scientific article; zbMATH DE number 1841813 (Why is no real title available?)
- scientific article; zbMATH DE number 786495 (Why is no real title available?)
- scientific article; zbMATH DE number 786499 (Why is no real title available?)
- scientific article; zbMATH DE number 7204450 (Why is no real title available?)
- A Characterization of Medial as Rewriting Rule
- A Local System for Classical Logic
- A complete axiomatisation for the inclusion of series-parallel partial orders
- A new correctness criterion for MLL proof nets
- A system of interaction and structure
- Additives of linear logic and normalization. I: A (restricted) Church-Rosser property.
- Coherent interaction graphs
- Decidability of linear affine logic
- From syntactic proofs to combinatorial proofs
- Handsome proof-nets: Perfect matchings and cographs
- Joachim Lambek: the interplay of mathematics, logic, and linguistics
- Light linear logic
- Linear Logic and Strong Normalization
- Linear logic
- MELL in the calculus of structures
- No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete
- On combinatorial proofs for logics of relevance and entailment
- On combinatorial proofs for modal logic
- On the decision problem for MELL
- Polynomial time in untyped elementary linear logic
- Proof diagrams for multiplicative linear logic: syntax and semantics
- Proofs without syntax
- Soft linear logic and polynomial time
- The relative efficiency of propositional proof systems
- The structure of multiplicatives
- Topology of series-parallel networks
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
- Towards a combinatorial proof theory
This page was built for publication: Exponentially handsome proof nets and their normalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657781)
