Duplication of directed graphs and exponential blow up of proofs (Q1125056): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0168-0072(99)00009-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992153273 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Duplication of directed graphs and exponential blow up of proofs |
scientific article |
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
