Identity of Proofs Based on Normalization and Generality

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. ?1. General proof theory. When a question is not in the main stream of mathematical investigations, and is also of a certain general, conceptual, kind, it runs the danger of being dismissed as "philosophical". Before the advent of recursion theory, many mathematicians would presumably have dismissed the question "What is a computable function?" as a philosophical question (or perhaps even as a psychological, empirical, question). It required something like the enthusiasm of a young discipline on the rise, which logic was in the first half of the twentieth century, for such a question to be embraced as legitimate, and seriously treated by mathematical means-with excellent results. An outsider might suppose that the question "What is a proof?" should be important for a field called proof theory, and then he would be surprised to find that this and related questions, one of which will occupy us here, Received on May 27, 2003; revised July 4, 2003; revised August 26, 2003. 2000 Mathematics Subject Classification. 03F03, 03F07, 03A05, 03-03.

[1]  Per Martin-Löf,et al.  An intuitionistic theory of types , 1972 .

[2]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[3]  S. Lane Natural Associativity and Commutativity , 1979 .

[4]  Richard Zach,et al.  Completeness Before Post: Bernays, Hilbert, and the Development of Propositional Logic , 1999, Bulletin of Symbolic Logic.

[5]  F. William Lawvere,et al.  Adjointness in Foundations , 1969 .

[6]  J. Riguet,et al.  Relations binaires, fermetures, correspondances de Galois , 1948 .

[7]  K O S T A D O ˇ S E N,et al.  Isomorphic objects in symmetric monoidal closed categories , 2022 .

[8]  Richard Brauer,et al.  On Algebras Which are Connected with the Semisimple Continuous Groups , 1937 .

[9]  N. Reshetikhin,et al.  Quantum Groups , 1993, hep-th/9311069.

[10]  G. M. Kelly,et al.  A generalization of the functorial calculus , 1966 .

[11]  G. Gentzen Untersuchungen über das logische Schließen. II , 1935 .

[12]  Peter Freyd,et al.  Aspects of topoi , 1972, Bulletin of the Australian Mathematical Society.

[13]  Zoran Petric Coherence in Substructural Categories , 2002, Stud Logica.

[14]  Alex K. Simpson Categorical completeness results for the simply-typed lambda-calculus , 1995, TLCA.

[15]  Kosta Dosen Identity of proofs based on normalization and generality , 2003, Bull. Symb. Log..

[16]  Hans Wenzl,et al.  On the structure of Brauer’s centralizer algebras , 1988 .

[17]  V. Turaev OPERATOR INVARIANTS OF TANGLES, AND R-MATRICES , 1990 .

[18]  P. Pudlák Chapter VIII - The Lengths of Proofs , 1998 .

[19]  Samuel R. Buss,et al.  The Undecidability of k-Provability , 1991, Ann. Pure Appl. Log..

[20]  Richard Statman,et al.  λ-definable functionals andβη conversion , 1983, Arch. Math. Log..

[21]  A. S. Troelstra Non-extensional equality , 1975 .

[22]  Yiannis N. Moschovakis,et al.  What Is an Algorithm? , 2012, SOFSEM.

[23]  W. Lickorish,et al.  An Introduction to Knot Theory , 1997 .

[24]  Rüdger Thiele,et al.  Hilbert's Twenty-Fourth Problem , 2002, Journal of Automated Reasoning.

[25]  Kosta Dosen,et al.  Logical Constants as Punctuation Marks , 1989, Notre Dame J. Formal Log..

[26]  D. Prawitz Ideas and Results in Proof Theory , 1971 .

[27]  G. Kreisel A Survey of Proof Theory II , 1971 .