Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination (Q4337947)
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: Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination |
scientific article; zbMATH DE number 1014086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination |
scientific article; zbMATH DE number 1014086 |
Statements
Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination (English)
0 references
27 May 1997
0 references
combinatorial aspect of proof theory
0 references
sequent calculus
0 references
cut elimination
0 references
interpolation theorem
0 references
Herbrand's theorem
0 references
logical flow graphs
0 references
geometry and dynamism in formal proofs
0 references
pigeonhole principle
0 references
John-Nirenberg theorem
0 references
nesting of quantifiers
0 references
0.8187367
0 references
0 references
0.77763087
0 references
0.7706597
0 references
