This is a preview of subscription content, log in via an institution to check access.
References
[C] Curry, H.B.: Foundations of mathematical logic. New York: McGraw-Hill 1963
[D] Dosen, K.: A note on Gentzen's decision procedure for intuitionistic propositional logic. Z. Math. Logik Grundlagen Math.33, 453–456 (1987)
[F] Franzen, T.: Algorithmic aspects of intuitionistic propositional logic, SICS Research Report R87010B
[G] Gentzen, G.: Untersuchungen über das logische Schliessen. Math. Z.39, 176–210, 405–431 (1935)
[Go] Gordeev, L.: On cut elimination in the presence of peirce rule. Arch. Math. Logik Grundlagenforschung26, 147–164 (1987)
[H] Hudelmaier, J.: A prolog program for intuitionistic logic. SNS-Bericht 88-28, 1988
[W-P] Wilkie, A.J., Paris, J.B.: On the scheme of induction for bounded arithmetic formulas. Ann. Pure Appl. Logic35, 261–302 (1987)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hudelmaier, J. Bounds for cut elimination in intuitionistic propositional logic. Arch Math Logic 31, 331–353 (1992). https://doi.org/10.1007/BF01627506
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01627506