Combinatorial flows as bicolored atomic flows
From MaRDI portal
Publication:6103000
DOI10.1007/978-3-031-15298-6_9OpenAlexW4297809238MaRDI QIDQ6103000
Lutz Straßburger, Giti Omidvar
Publication date: 2 June 2023
Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15298-6_9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Interpolants, cut elimination and flow graphs for the propositional calculus
- Natural deduction and coherence for weakly distributive categories
- The undecidability of \(k\)-provability
- The structure of multiplicatives
- Turning cycles into spirals
- Handsome proof-nets: Perfect matchings and cographs
- Proofs without syntax
- Coherence in closed categories
- Proof equivalence in MLL is PSPACE-complete
- Rewriting with Linear Inferences in Propositional Logic
- A Local System for Classical Logic
- A Survey of Graphical Languages for Monoidal Categories
- Normalisation Control in Deep Inference via Atomic Flows
- The relative efficiency of propositional proof systems
- Hilbert's Twenty-Fourth Problem
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
- Deep inference and expansion trees for second-order multiplicative linear logic
- From Proof Nets to the Free *-Autonomous Category
- A Proof Calculus Which Reduces Syntactic Bureaucracy
- A Characterization of Medial as Rewriting Rule
- Typed Lambda Calculi and Applications
