No label defined (Q3140635)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 440478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 440478 |
Statements
21 August 1994
0 references
combinatorial principles
0 references
polynomial-size proofs
0 references
ALOGTIME computable functions
0 references
Frege proof
0 references
0.8373849391937256
0 references
0.8011115193367004
0 references
0.7999451160430908
0 references
0.7981935143470764
0 references
0.7776247262954712
0 references
For several combinatorial principles \(P\) similar to the pigeonhole principle it took time to find polynomial-size proofs in a standard (Frege) formulation of propositional logic with axioms and the rule of modus ponens. The author presents new proofs using the equation calculus ALV\('\) for ALOGTIME computable functions. First, a general result (\(F\) simulation theorem) is established. It shows that if a suitable version of the principle \(P\) is provable in ALV\('\), then \(P\) has a polynomial- size Frege proof. Then \(P\) is proved in ALV\('\). For the entire collection see [Zbl 0777.00008].
0 references