Polynomially and superexponentially shorter proofs in fragments of arithmetic (Q4032866)
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: Polynomially and superexponentially shorter proofs in fragments of arithmetic |
scientific article; zbMATH DE number 150233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomially and superexponentially shorter proofs in fragments of arithmetic |
scientific article; zbMATH DE number 150233 |
Statements
Polynomially and superexponentially shorter proofs in fragments of arithmetic (English)
0 references
1 April 1993
0 references
fragments of arithmetic
0 references
provability logic
0 references
speed-up
0 references
modal logic
0 references
lengths of proofs
0 references
0 references
0.9102959
0 references
0.8736881
0 references
0.8700881
0 references
0.86958253
0 references
0.86294657
0 references
0.8618345
0 references
0.8604504
0 references
