Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:30, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II |
scientific article |
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
