On the computational content of intuitionistic propositional proofs-Reference-Cited by-同舟云学术

On the computational content of intuitionistic propositional proofs

Published:2001-05 Issue:1-2 Volume:109 Page:49-64
ISSN:0168-0072
Container-title:Annals of Pure and Applied Logic
language:en
Short-container-title:Annals of Pure and Applied Logic

Author:

Buss Samuel R,Pudlák Pavel

Publisher

Elsevier BV

Subject

Logic

Reference10 articles.

1. M.L. Bonet, T. Pitassi, R. Raz, No feasible interpolation for TC0-Frege proofs, in: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Piscataway, NJ, IEEE Computer Society Press, Silver Spring, MD, pp. 254–263.

2. An introduction to proof theory;Buss,1998

3. The complexity of the disjunction and existence properties in intuitionistic logic;Buss;Ann. Pure Appl. Logic,1999

4. A. Goerdt, Efficient interpolation for the intuitionistic sequent calculus, Technische Universität Chemnitz, CSR-00-02, January 2000, preprint.

5. Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic;Krajı́ček;J. Symbolic Logic,1997

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

1. On the proof complexity of logics of bounded branching;Annals of Pure and Applied Logic;2023-01

2. A Calculus of Tracking: Theory and Practice;Proceedings on Privacy Enhancing Technologies;2021-01-29

3. An Exponential Lower Bound for Proofs in Focused Calculi;Logic, Language, Information, and Computation;2019

4. INCOMPLETENESS IN THE FINITE DOMAIN;The Bulletin of Symbolic Logic;2017-12

5. Proof complexity of intuitionistic implicational formulas;Annals of Pure and Applied Logic;2017-01