The deduction theorem for strong propositional proof systems (Q987382): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59903234 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993478355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of representable disjoint \textsf{NP}-pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Deduction Theorem for Strong Propositional Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Closure Properties of Propositional Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tuples of disjoint \(\mathsf{NP}\)-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The deduction rule and linear and near-linear proof simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions between disjoint NP-pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint NP-Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical disjoint NP-pairs of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles for structural properties: The isomorphism problem and public-key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal proof systems imply complete sets for promise classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional proof systems, the consistency of first order theories and the complexity of computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reducibility and symmetry of disjoint NP pairs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an optimal propositional proof system and the structure of easy subsets of TAUT. / rank
 
Normal rank

Latest revision as of 02:40, 3 July 2024

scientific article
Language Label Description Also known as
English
The deduction theorem for strong propositional proof systems
scientific article

    Statements

    The deduction theorem for strong propositional proof systems (English)
    0 references
    0 references
    13 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    deduction theorem
    0 references
    optimal propositional proof systems
    0 references
    disjoint {\textsf{NP}}-pairs
    0 references
    Frege systems
    0 references
    0 references
    0 references