Logical Closure Properties of Propositional Proof Systems (Q3502657): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the automatizability of resolution and related propositional proof systems / 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: 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: Lower bounds for cutting planes proofs with small coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133141 / 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: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286672 / 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: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / 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: Quantified propositional calculi and fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone 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
Property / cites work
 
Property / cites work: Q5422270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rudimentary Predicates and Relative Computation / rank
 
Normal rank

Latest revision as of 10:52, 28 June 2024

scientific article
Language Label Description Also known as
English
Logical Closure Properties of Propositional Proof Systems
scientific article

    Statements

    Logical Closure Properties of Propositional Proof Systems (English)
    0 references
    0 references
    27 May 2008
    0 references
    0 references
    extended Frege proof system
    0 references
    0 references
    0 references