Duplication of directed graphs and exponential blow up of proofs (Q1125056)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Duplication of directed graphs and exponential blow up of proofs |
scientific article; zbMATH DE number 1371586
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Duplication of directed graphs and exponential blow up of proofs |
scientific article; zbMATH DE number 1371586 |
Statements
Duplication of directed graphs and exponential blow up of proofs (English)
0 references
25 July 2000
0 references
The author presents in a self-contained and suggestive way a combinatorial analysis of cut-elimination in Gentzen sequent calculus LK. One motivation is the search for ``hard tautologies'' for LK. The author associates a special kind of graph to each proof. Some upper and lower bounds for cut-elimination are then obtained which depend only on the associated graphs.
0 references
cut elimination
0 references
structure of proofs
0 references
proof complexity
0 references
Gentzen sequent calculus
0 references
0 references
0 references
0.8601018
0 references
0.8536167
0 references
0.85345954
0 references
0.85080403
0 references
0.8492079
0 references
0 references
