Depth of proofs, depth of cut-formulas and complexity of cut formulas (Q1329747)
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: Depth of proofs, depth of cut-formulas and complexity of cut formulas |
scientific article; zbMATH DE number 612377
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Depth of proofs, depth of cut-formulas and complexity of cut formulas |
scientific article; zbMATH DE number 612377 |
Statements
Depth of proofs, depth of cut-formulas and complexity of cut formulas (English)
0 references
31 July 1994
0 references
The standard cut-elimination procedure for classical predicate logic is modified to make alternation of quantifiers (rather than the number of quantifiers) the main complexity parameter.
0 references
cut-elimination
0 references
alternation of quantifiers
0 references
complexity
0 references
