Handsome proof-nets: Perfect matchings and cographs

DOI10.1016/S0304-3975(01)00175-XzbMath1028.68154OpenAlexW2076596727MaRDI QIDQ1398476

Christian Retoré

Publication date: 29 July 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00175-x

zbMATH Keywords

MatchingGraph theoryProof theoryLinear logicCograph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (14)

An Analytic Propositional Proof System on Graphs ⋮ An introduction to differential linear logic: proof-nets, models and antiderivatives ⋮ Unnamed Item ⋮ Combinatorial flows as bicolored atomic flows ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Residuation ⋮ Towards Hilbert's 24th Problem: Combinatorial Proof Invariants ⋮ A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem ⋮ Unnamed Item ⋮ Linear-time algorithm for the matched-domination problem in cographs ⋮ Pomset Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Matching theory
• Natural deduction and coherence for weakly distributive categories
• The structure of multiplicatives
• A new correctness criterion for cyclic proof nets
• Topology of series-parallel networks
• A Linear Recognition Algorithm for Cographs
• Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
• The mix rule
• A complete axiomatisation for the inclusion of series-parallel partial orders

This page was built for publication: Handsome proof-nets: Perfect matchings and cographs