Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637)
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: Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II |
scientific article; zbMATH DE number 1493435
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II |
scientific article; zbMATH DE number 1493435 |
Statements
Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (English)
0 references
21 August 2000
0 references
automated theorem proving
0 references
computational complexity
0 references
proof theory
0 references
cut-free Gentzen system LK with permutation
0 references
permutation inference
0 references
renaming inference
0 references
feasible subformula property
0 references
relative efficiency
0 references
Frege systems
0 references
0 references
