Order:
  1.  34
    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.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  11
    Lower Bounds for dnf-refutations of a relativized weak pigeonhole principle.Albert Atserias, Moritz Müller & Sergi Oliva - 2015 - Journal of Symbolic Logic 80 (2):450-476.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  15
    Stephen Cook and Phuong Nguyen. Logical foundations of proof complexity. Perspectives in Logic. Cambridge University Press, New York, 2010, 15 + 479 pp. [REVIEW]Albert Atserias - 2011 - Bulletin of Symbolic Logic 17 (3):462-464.