Exponentially handsome proof nets and their normalization

DOI10.4204/EPTCS.353.1MaRDI QIDQ6657781

Matteo Acclavio

Publication date: 6 January 2025

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear logic
• The structure of multiplicatives
• Light linear logic
• Handsome proof-nets: Perfect matchings and cographs
• Additives of linear logic and normalization. I: A (restricted) Church-Rosser property.
• On the decision problem for MELL
• From syntactic proofs to combinatorial proofs
• Soft linear logic and polynomial time
• Decidability of linear affine logic
• MELL in the calculus of structures
• Polynomial time in untyped elementary linear logic
• On combinatorial proofs for modal logic
• Towards a combinatorial proof theory
• On combinatorial proofs for logics of relevance and entailment
• Proof diagrams for multiplicative linear logic: syntax and semantics
• Topology of series-parallel networks
• Proofs without syntax
• Linear Logic and Strong Normalization
• A Local System for Classical Logic
• The relative efficiency of propositional proof systems
• A complete axiomatisation for the inclusion of series-parallel partial orders
• A new correctness criterion for MLL proof nets
• No proof nets for MLL with units
• Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
• Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics
• A system of interaction and structure
• A Characterization of Medial as Rewriting Rule

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)