Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Noriko H. Arai / rank
Normal rank
 
Property / author
 
Property / author: Noriko H. Arai / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of cut-free Gentzen type propositional calculus with permutation inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proper hierarchy of propositional sequent calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded arithmetic AID for Frege systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on lengths of propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size proofs of the propositional pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution proofs of generalized pigeonhole principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes, connectivity, and threshold logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional consistency proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional interpretations of feasibly constructive arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory. 2nd ed / rank
 
Normal rank

Revision as of 13:13, 30 May 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
    0 references
    0 references
    0 references
    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