Switch to: References

Add citations

You must login to add citations.
  1. Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.
    We describe a method of forcing against weak theories of arithmetic and its applications in propositional proof complexity.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Matrix identities and the pigeonhole principle.Michael Soltys & Alasdair Urquhart - 2004 - Archive for Mathematical Logic 43 (3):351-357.
    We show that short bounded-depth Frege proofs of matrix identities, such as PQ=I⊃QP=I (over the field of two elements), imply short bounded-depth Frege proofs of the pigeonhole principle. Since the latter principle is known to require exponential-size bounded-depth Frege proofs, it follows that the propositional version of the matrix principle also requires bounded-depth Frege proofs of exponential size.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Bounded-depth Frege complexity of Tseitin formulas for all graphs.Nicola Galesi, Dmitry Itsykson, Artur Riazanov & Anastasia Sofronova - 2023 - Annals of Pure and Applied Logic 174 (1):103166.
    Download  
     
    Export citation  
     
    Bookmark