Are there Hard Examples for Frege Systems?-Reference-Cited by-同舟云学术

Are there Hard Examples for Frege Systems?

Published:1995 Issue: Volume: Page:30-56
ISSN:
Container-title:Feasible Mathematics II
language:
Short-container-title:

Author:

Bonet Maria Luisa,Buss Samuel R.,Pitassi Toniann

Publisher

Birkhäuser Boston

Link

http://link.springer.com/content/pdf/10.1007/978-1-4612-2566-9_3.pdf

Reference32 articles.

1. M. Ajtai, The complexity of the pigeonhole principle, in Proceedings of the 29-th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 346–355.

2. L. Babai and P. Frankl, Linear algebra methods in combinatorics. Preliminary version of book, 1988.

3. S. R. Buss, The Boolean formula value problem is in ALOGTIME, in Proceedings of the 19-th Annual ACM Symposium on Theory of Computing, May 1987, pp. 123 – 131.

4. S. R. Buss, Polynomial size proofs of the propositional pigeonhole principle, Journal of Symbolic Logic, 52 (1987), pp. 916 – 927.

5. S. R. Buss, Propositional consistency proofs, Annals of Pure and Applied Logic, 52 (1991), pp. 3 – 29.

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

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

2. QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS;The Journal of Symbolic Logic;2016-05-10

3. Short Proofs of the Kneser-Lovász Coloring Principle;Automata, Languages, and Programming;2015

4. Propositional Proofs in Frege and Extended Frege Systems (Abstract);Lecture Notes in Computer Science;2015

5. Proof Complexity and the Kneser-Lovász Theorem;Lecture Notes in Computer Science;2014