Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046)
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: Publication:672046 |
scientific article; zbMATH DE number 984748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tractability of cut-free Gentzen type propositional calculus with permutation inference |
scientific article; zbMATH DE number 984748 |
Statements
Tractability of cut-free Gentzen type propositional calculus with permutation inference (English)
0 references
27 February 1997
0 references
automatic reasoning
0 references
computational complexity
0 references
permutation
0 references
cut-free Gentzen type propositional calculus
0 references
polynomial size proofs for hard combinatorial problems
0 references
pigeonhole principles
0 references
consistency
0 references
subformula property
0 references
relative efficiency
0 references
Frege systems
0 references
0.9118295311927797
0 references
0.9082847237586976
0 references
0.7799046039581299
0 references
