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.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Non-Tightness in Class Theory and Second-Order Arithmetic.Alfredo Roque Freire & Kameryn J. Williams - forthcoming - Journal of Symbolic Logic:1-28.
    A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including $\mathsf {PA}$ [39], $\mathsf {ZF}$, $\mathsf {Z}_2$, and $\mathsf {KM}$ [6]. In this article we extend Enayat’s investigations to subsystems of these latter two theories. We prove that restricting the Comprehension schema of $\mathsf {Z}_2$ and $\mathsf {KM}$ gives non-tight theories. Specifically, we show that $\mathsf {GB}$ and $\mathsf {ACA}_0$ each admit different bi-interpretable extensions, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark