Normalization of N-graphs via sub-N-graphs
From MaRDI portal
Publication:1744401
Recommendations
- Proof-graphs: a thorough cycle treatment, normalization and subformula property
- Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization
- On strong normalization in proof-graphs for propositional logic
- Natural deduction via graphs: formal definition and computation rules
- scientific article; zbMATH DE number 7599997
Cites work
- Duplication of directed graphs and exponential blow up of proofs
- scientific article; zbMATH DE number 3162889 (Why is no real title available?)
- scientific article; zbMATH DE number 3591947 (Why is no real title available?)
- scientific article; zbMATH DE number 2020175 (Why is no real title available?)
- scientific article; zbMATH DE number 874672 (Why is no real title available?)
- scientific article; zbMATH DE number 3275554 (Why is no real title available?)
- Linear logic
- Linear time proof verification on N-graphs: a graph theoretic approach
- Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination
- Natural deduction and coherence for weakly distributive categories
- Proof-graphs: a thorough cycle treatment, normalization and subformula property
- Sequentialization for n-graphs via sub-n-graphs
- The correspondence between cut-elimination and normalization
- The structure of multiplicatives
- The undecidability of k-provability
- Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization
Cited in
(4)
This page was built for publication: Normalization of N-graphs via sub-N-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744401)