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  
  • Hard instances of algorithms and proof systems.Yijia Chen, Jörg Flum & Moritz Müller - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 118--128.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
    Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6f97f49787-zrclg uwo