Duplication of directed graphs and exponential blow up of proofs
From MaRDI portal
Publication:1125056
DOI10.1016/S0168-0072(99)00009-3zbMath0945.03081OpenAlexW1992153273MaRDI QIDQ1125056
Publication date: 25 July 2000
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-0072(99)00009-3
Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Directed graphs (digraphs), tournaments (05C20) Complexity of proofs (03F20)
Related Items
Structure of proofs and the complexity of cut elimination, The cost of a cycle is a square, Categorical proof theory of classical propositional calculus, Sufficient conditions for cut elimination with complexity analysis, Normalization of N-graphs via sub-N-graphs, Asymptotic cyclic expansion and bridge groups of formal proofs, Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization, The geometry of non-distributive logics, Logical structures and genus of proofs, Streams and strings in formal proofs.
