Normalization of N-graphs via sub-N-graphs
From MaRDI portal
Publication:1744401
DOI10.1016/j.entcs.2016.06.002zbMath1395.03026OpenAlexW2474768001WikidataQ113317687 ScholiaQ113317687MaRDI QIDQ1744401
Anjolina de Oliveira, Laís Andrade, Ruan Carvalho, Ruy J. G. B. de Queiroz
Publication date: 23 April 2018
Full work available at URL: https://doi.org/10.1016/j.entcs.2016.06.002
Applications of graph theory (05C90) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Duplication of directed graphs and exponential blow up of proofs
- Natural deduction and coherence for weakly distributive categories
- The undecidability of \(k\)-provability
- The structure of multiplicatives
- Linear Time Proof Verification on N-Graphs: A Graph Theoretic Approach
- Sequentialization for N-Graphs via Sub-N-Graphs
- Proof-graphs: a Thorough Cycle Treatment, Normalization and Subformula Property
- Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization
- The correspondence between cut-elimination and normalization
- Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination
