Depth of proofs, depth of cut-formulas and complexity of cut formulas (Q1329747): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(94)90087-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022618710 / rank | |||
Normal rank | |||
Revision as of 21:25, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Depth of proofs, depth of cut-formulas and complexity of cut formulas |
scientific article |
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
