This is a preview of subscription content, log in via an institution to check access.
References
Eick, A. and E. Fehr: 1982, ‘Inconsistencies of pure LISP’, in A. B. Cremers and H. P. Kriegel (eds.), Theoretical Computer Science (6th GI-Conference), Springer-Verlag, Berlin, pp. 101–110.
Gandy, R. O.: 1980, ‘Proofs of strong normalization’, in J. P. Seldin and J. R. Hindley (eds.), To H. B. Curry. Essays on combinatory logic, lambda calculus and formalism, Academic Press, London-New York, pp. 457–477.
Garey, M. R. and D. S. Johnson: 1979, Computers and intractability. A guide to the theory of NP-completeness, Freeman and Co., San Francisco.
Girard, J.-Y.: 1984, Proof theory and logical complexity, Bibliopolis, Naples.
Grzegorczyk, A.: 1953, ‘Some classes of recursive functions’, Rozprawy Matematyczne 4, 1–45.
Howard, W.: 1980, ‘The formulae-as-types notion of construction’, in J. P. Seldin and J. R. Hindley (eds.), To H. B. Curry. Essays on combinatory logic, lambda calculus and formalism, Academic Press, London-New York, pp. 479–490.
Kleene, S. C.: 1935, ‘A theory of positive integers in formal logic. I’, American Journal of Mathematics 57, 153–173.
Kolmogorov, A. N.: 1932, ‘Zur Deutung der intuitionistischen Logik’, Mathematische Zeitschrift 35, 58–65.
Minc, G. E.: 1982, ‘Primitive recursive estimate of strong normalization for predicate calculus’, Journal of Soviet Mathematics 20, 2334–2336.
Prawitz, D.: 1965, Natural deduction. A proof-theoretical study, Almqvist & Wiksell, Stockholm.
Prawitz, D.: 1971, ‘Ideas and results in proof theory’, in J. E. Fenstad (ed.), Proceedings of the Second Scandinavian Logic Symposium, North-Holland, Amsterdam, pp. 235–307.
Prawitz, D.: 1981, ‘Validity and normalizability of proofs in 1st and 2nd order classical and intuitionistic logic’, in S. Bernini (ed.), Atti del Congresso Nazionale di Logica, Montecatini Terme 1–5 ottobre 1979, Bibliopolis, Naples, pp. 11–36.
Schwichtenberg, H.: 1982, ‘Complexity of normalization in the pure typed lambdacalculus’, in A. S. Troelstra and D. van Dalen (eds.), The L.E.J. Brouwer Centenary Symposium, North-Holland, Amsterdam, pp. 453–457.
Statman, R.: 1974, Structural complexity of proofs, Dissertation, Stanford University.
Statman, R.: 1978, ‘Bounds for proof-search and speed-up in the predicate calculus’, Annals of Mathematical Logic 15, 225–287.
Statman, R.: 1979, ‘The typed λ-calculus is not elementary recursive’, Theoretical Computer Science 9, 73–81.
Wang, H.: 1981, Popular lectures on mathematical logic, Van Nostrand, New York and Science Press, Beijing.
Zucker, J.: 1974, ‘The correspondence between cut-elimination and normalization’, Annals of Mathematical Logic 7, 1–155.
Author information
Authors and Affiliations
Additional information
This is a revised and retitled version of a paper presented to the workshop ‘The present state of the problem of foundations of mathematics' held at the Villa di Mondeggi, 15–19 June 1981.
Rights and permissions
About this article
Cite this article
Cellucci, C. Proof theory and complexity. Synthese 62, 173–189 (1985). https://doi.org/10.1007/BF00486045
Issue Date:
DOI: https://doi.org/10.1007/BF00486045