Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tractability of cut-free Gentzen type propositional calculus with permutation inference |
scientific article |
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
