Identity of proofs based on normalization and generality

Bulletin of Symbolic Logic 9 (4):477-503 (2003)
  Copy   BIBTEX

Abstract

Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz's, based on reduction to cut-free form in sequent systems, but he also suggested understanding identity of proofs in terms of an equivalence relation based on generality, two derivations having the same generality if after generalizing maximally the rules involved in them they yield the same premises and conclusions up to a renaming of variables. These two proposals proved to be extensionally equivalent only for limited fragments of logic. The normalization proposal stands behind very successful applications of the typed lambda calculus and of category theory in the proof theory of intuitionistic logic. In classical logic, however, it did not fare well. The generality proposal was rather neglected in logic, though related matters were much studied in pure category theory in connection with coherence problems, and there are also links to low-dimensional topology and linear algebra. This proposal seems more promising than the other one for the general proof theory of classical logic

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
260 (#77,599)

6 months
8 (#353,767)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Proof-Theoretic Semantics.Peter Schroeder-Heister - forthcoming - Stanford Encyclopedia of Philosophy.
Advances in Proof-Theoretic Semantics.Peter Schroeder-Heister & Thomas Piecha (eds.) - 2015 - Cham, Switzerland: Springer Verlag.
Why do mathematicians re-prove theorems?John W. Dawson Jr - 2006 - Philosophia Mathematica 14 (3):269-286.

View all 32 citations / Add more citations

References found in this work

Ideas and Results in Proof Theory.Dag Prawitz & J. E. Fenstad - 1971 - Journal of Symbolic Logic 40 (2):232-234.
Introduction to Higher Order Categorical Logic.J. Lambek & P. J. Scott - 1989 - Journal of Symbolic Logic 54 (3):1113-1114.
Adjointness in Foundations.F. William Lawvere - 1969 - Dialectica 23 (3‐4):281-296.
Logical constants as punctuation marks.Kosta Došen - 1989 - Notre Dame Journal of Formal Logic 30 (3):362-381.

View all 22 references / Add more references