Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(98)00186-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031662653 / rank | |||
Normal rank | |||
Latest revision as of 10:21, 30 July 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
0 references
