Partially definable forcing and bounded arithmetic-Reference-Cited by-同舟云学术

Partially definable forcing and bounded arithmetic

Published:2014-08-29 Issue:1-2 Volume:54 Page:1-33
ISSN:0933-5846
Container-title:Archive for Mathematical Logic
language:en
Short-container-title:Arch. Math. Logic

Author:

Atserias Albert,Müller Moritz

Publisher

Springer Science and Business Media LLC

Subject

Logic,Philosophy

Link

http://link.springer.com/content/pdf/10.1007/s00153-014-0398-3.pdf

Reference51 articles.

1. Ajtai, M.: The complexity of the pigeonhole principle. In: Proceedings of the 29th Annual Symposion on the Foundations of Computer Science, pp. 346–355 (1988)

2. Atserias A., Dalmau V.: A combinatorial characterization of resolution width. J. Comput. Syst. Sci. 74(3), 323–334 (2008)

3. Avigad J.: Forcing in proof theory. Bull. Symb. Logic 10(3), 305–333 (2004)

4. Beame, P.: A switching lemma primer. Technical report UW-CSE-95-07-01, University of Washington (1994)

5. Beame, P., Pitassi, T.: Propositional proof complexity: past, present, and future. In: Paun G, Rozenberg G, Salomaa A (eds.) Current Trends in Theoretical Computer Science Entering the 21st Century. World Scientific Publishing, pp. 42–70 (2001)

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On some $$\Sigma ^{B}_{0}$$-formulae generalizing counting principles over $$V^{0}$$;Archive for Mathematical Logic;2024-07-22

2. On the Consistency of Circuit Lower Bounds for Non-deterministic Time;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Typical forcings, NP search problems and an extension of a theorem of Riis;Annals of Pure and Applied Logic;2021-04

4. Automating Resolution is NP-Hard;Journal of the ACM;2020-10-16

5. Automating Resolution is NP-Hard;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11