Depth of proofs, depth of cut-formulas and complexity of cut formulas (Q1329747): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The number of proof lines and the size of proofs in first order logic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5310891 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cut elimination and automatic proof procedures / rank | |||
Normal rank | |||
Latest revision as of 16:08, 22 May 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
