The role of quantifier alternations in cut elimination (Q2565988): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computer Science Logic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The unprovability of small inconsistency. A study of local and global interpretability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cut elimination and automatic proof procedures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth of proofs, depth of cut-formulas and complexity of cut formulas / rank | |||
Normal rank | |||
Revision as of 15:55, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The role of quantifier alternations in cut elimination |
scientific article |
Statements
The role of quantifier alternations in cut elimination (English)
0 references
28 September 2005
0 references
proof complexity
0 references
cut elimination
0 references
quantifier alternations
0 references
