IDentity Of Proofs Based On Normalization And Generality

Bulletin of Symbolic Logic

Volumn 9, Issue 4, 2003, Pages 477-503

  Došen, Kosta ^a  

^a MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Categorial coherence; Criteria of identity; Cut elimination and normal form; Generality; Proof

Indexed keywords

EID: 0348173887     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2178/bsl/1067620091     Document Type: Article

References (58)

1. R. Brauer, On algebras which are connected with the semisimple continuous groups, Annals of Mathematics, vol. 38 (1937), pp. 857-872.
2. S.R. Buss, The undecidability of k-provability, Annals of Pure and Applied Logic, vol. 53 (1991), pp. 75-102.
3. A. Carbone, Interpolants, cut elimination and flow graphs for the propositional calculus, Annals of Pure and Applied Logic, vol. 83 (1997), pp. 249-299.
4. J.R.B. Cockett and R.A.G. Seely, Weakly distributive categories, Journal of Pure and Applied Algebra, vol. 114 (1997), pp. 133-173 (updated version available at: http://www.math.mcgill.ca/rags).
5. K. DoSen, Logical constants as punctuation marks, Notre Dame Journal of Formal Logic, vol. 30 (1989), pp. 362-381; slightly amended version in What is a logical system? (D. M. Gabbay, editor), Oxford University Press, Oxford, 1994, pp. 273-296.
6. K. DoSen, Cut elimination in categories, Kluwer, Dordrecht, 1999.
7. K. DoSen, Abstraction and application in adjunction, Proceedings of the Tenth Congress of Yugoslav Mathematicians (Z. Kadelburg, editor), Faculty of Mathematics, University of Belgrade, Belgrade, 2001, pp. 33-46 (available at: http://arXiv.org/math.CT/0111061).
8. K. DoSen, Models of deduction, to appear in Proceedings of the conference “Proof-Theoretic Semantics, Tubingen 1999” (P. Schroeder-Heister, editor), Oxford University Press, Oxford.
9. K. DoSen, Simplicial endomorphisms, preprint (available at: http://arXiv.org/math.GT/0301302), 2003.
10. K. Dosen and Z. Petris, Isomorphic objects in symmetric monoidal closed categories, Mathematical Structures in Computer Science, vol. 7 (1997), pp. 639-662.
11. K. Dosen and Z. Petris, The maximality of the typed lambda calculus and of cartesian closed categories, Publications de l’Institut Mathématique (N.S.), vol. 68(82) (2000), pp. 1-19 (available at: http://arXiv.org/math.CT/9911073).
12. K. Dosen and Z. Petris, The maximality of cartesian categories, Mathematical Logic Quarterly, vol. 47 (2001), pp. 137-144 (available at: http://arXiv.org/math.CT/9911059).
13. K. Dosen and Z. Petris, Coherent bicartesian and sesquicartesian categories, Proof theory in computer science (R. Kahle et al., editors), Lecture Notes in Computer Science, vol. 2183, Springer, Berlin, 2001, pp. 78-92 (available at: http://arXiv.org/math.CT/0006091).
14. K. Dosen and Z. Petris, Bicartesian coherence, Studia Logica, vol. 71 (2002), pp. 331-353 (version with some corrections in the proof of maximality available at: http://arXiv.org/math.CT/ 0006052).
15. K. Dosen and Z. Petris, Generality of proofs and its Brauerian representation, to appear in The Journal of Symbolic Logic (available at: http://arXiv.org/math.LO/0211090), 2002.
16. K. Dosen and Z. Petris, A Brauerian representation of split preorders, to appear in Mathematical Logic Quarterly (available at: http://arXiv.org/math.LO/0211277), 2002.
17. K. Dosen and Z. Petris, Self-adjunctions and matrices, Journal of Pure and Applied Algebra, vol. 184 (2003), pp. 7-39 (unabridged version available at: http://arXiv.org/math.GT/0111058).
18. S. Eilenberg and G.M. Kelly, A generalization of the functorial calculus, Journal of Algebra, vol. 3 (1966), pp. 366-375.
19. S. Feferman, Review of [44], The Journal of Symbolic Logic, vol. 40 (1975), pp. 232-234.
20. P. Freyd, Aspects of topoi, Bulletin of the Australian Mathematical Society, vol. 7 (1972), pp. 1-76.
21. G. Gentzen, Untersuchungen über das logische Schließen, Mathematische Zeitschrift, vol. 39 (1935), pp. 176-210, 405-431; English translation: Investigations into logical deduction, The collected papers of Gerhard Gentzen (M. E. Szabo, editor), North-Holland, Amsterdam, 1969, pp. 68-131.
22. J.-Y. Girard, P. Taylor and Y. Lafont, Proofs and types, Cambridge University Press, Cambridge, 1989.
23. V.F.R. Jones, A quotient of the affine Hecke algebra in the Brauer algebra, L’Enseignement Mathematique (2), vol. 40 (1994), pp. 313-344.
24. C. Kassel, Quantum groups, Springer, Berlin, 1995.
25. L.H. Kauffman and S.L. Lins, Temperley-Lieb recoupling theory and invariants of 3-manifolds, Annals of Mathematical Studies, vol. 134, Princeton University Press, Princeton, 1994.
26. G.M. Kelly and S. Mac Lane, Coherence in closed categories, Journal of Pure and Applied Algebra, vol. 1 (1971), pp. 97-140, 219.
27. G. Kreisel, A survey ofproof theory II, Proceedings of the Second Scandinavian Logic Symposium (J.E. Fenstad, editor), North-Holland, Amsterdam, 1971, pp. 109-170.
28. J. Lambek, Deductive systems and categories I: Syntactic calculus and residuated categories, Mathematical Systems Theory, vol. 2 (1968), pp. 287-318.
29. J. Lambek, Deductive systems and categories II: Standard constructions and closed cate gories, Category theory, homology theory and their applications I, Lecture Notes in Mathematics, vol. 86, Springer, Berlin, 1969, pp. 76-122.
30. J. Lambek, Deductive systems and categories III: Cartesian closed categories, intuitionist propositional calculus, and combinatory logic, Toposes, algebraic geometry and logic (F.W. Lawvere, editor), Lecture Notes in Mathematics, vol. 274, Springer, Berlin, 1972, pp. 57-82.
31. J. Lambek, Functional completeness of cartesian categories, Annals ofMathematical Logic, vol. 6 (1974), pp. 259-292.
32. J. Lambek and P.J. Scott, Introduction to higher-order categorical logic, Cambridge University Press, Cambridge, 1986.
33. F.W. Lawvere, Adjointness in foundations, Dialectica, vol. 23 (1969), pp. 281-296.
34. T. Leinster, Topology and higher-dimensional category theory: The rough idea (available at: http://arXiv.org/math.CT/0111058), 2001.
35. J. Lambek, A survey of definitions of n-category, Theory and Application of Categories, vol. 10 (2002), pp. 1-70 (available at: http://arXiv.org/math.CT/0107188).
36. W.B.R. Lickorish, An introduction to knot theory, Springer, Berlin, 1997.
37. S. Mac Lane, Natural associativity and commutativity, Rice University Studies, Papers in Mathematics, vol. 49 (1963), pp. 28-46.
38. S. Mac Lane, editor, Coherence in categories, Lecture Notes in Mathematics, vol. 281, Springer, Berlin, 1972.
39. P. Martin-Lof, An intuitionistic theory of types: Predicative part, Logic Colloquium’73 (H.E. Rose and J.C. Shepherdson, editors), North-Holland, Amsterdam, 1975, pp. 73118.
40. P. Martin-Lof, About models for intuitionistic type theories and the notion of definitional equality, Proceedings of the Third Scandinavian Logic Symposium (S. Kanger, editor), North-Holland, Amsterdam, 1975, pp. 81-109.
41. Y.N. Moschovakis, What is an algorithm?, Mathematics unlimited—2001 and beyond (B. Engquist and W. Schmid, editors), Springer, Berlin, 2001, pp. 919-936.
42. Z. Petric, Coherence in substructural categories, Studia Logica, vol. 70 (2002), pp. 271-296 (available at: http://arXiv.org/math.CT/0006061).
43. V.V. Prasolov and A.B. Sosinskii, Knots, links, braids and 3-manifolds (in Russian), MCNMO, Moscow, 1997.
44. D. Prawitz, Ideas and results in proof theory, Proceedings of the Second Scandinavian Logic Symposium (J.E. Fenstad, editor), North-Holland, Amsterdam, 1971, pp. 235-307.
45. D. Prawitz, Philosophical aspects ofproof theory, Contemporary philosophy: A new survey, vol. 1 (G. Fl0istad, editor), Nijhoff, The Hague, 1981, pp. 235-277.
46. P. PudlAk, The lengths ofproofs, Handbook ofproof theory (S. Buss, editor), North-Holland, Amsterdam, 1998, pp. 547-637.
47. J. Riguet, Relations binaires, fermetures, correspondances de Galois, Bulletin de la Société mathématique de France, vol. 76 (1948), pp. 114-155.
48. A.K. Simpson, Categorical completeness results for the simply-typed lambda-calculus, Typed lambda calculi and applications (M. Dezani-Ciancaglini and G. Plotkin, editors), Lecture Notes in Computer Science, vol. 902, Springer, Berlin, 1995, pp. 414-427.
49. S.V. Soloviev, The category of finite sets and cartesian closed categories (in Russian), Zapiski Nauchnykh Seminarov (LOMI), vol. 105 (1981), pp. 174-194 (English translation in Journal of Soviet Mathematics, vol. 22 (1983), pp. 1387-1400).
50. R. StatMAn, X-definable functionals and P^-conversion, Archiv fur mathematische Logik und Grundlagenforschung, vol. 23 (1983), pp. 21-26.
51. M.E. SzAbo, Algebra of proofs, North-Holland, Amsterdam, 1978.
52. R. THieie, Hilbert’s twenty-fourth problem, American Mathematical Monthly, vol. 110 (2003), pp. 1-24.
53. A.S. Troelstra, Non-extensionalequality, Fundamenta Mathematicae, vol. 82 (1975), pp. 307-322.
54. V.G. TuRAev, Operator invariants of tangles and R-matrices (in Russian), Izvestiya Akademii Nauk SSSR, Seriya Matematicheskaya, vol. 53 (1989), pp. 1073-1107 (English translation in Mathematics of the USSR-Izvestiya, vol. 35, 1990, pp. 411-444).
55. H. Wenzi, On the structure of Brauer’s centralizer algebras, Annals of Mathematics, vol. 128 (1988), pp. 173-193.
56. F. WiDeback, Identity of proofs, doctoral dissertation, University of Stockholm, Almqvist & Wiksell, Stockholm, 2001.
57. D.N. Yetter, Markov algebras, Braids (J.S. Birman and A. Libgober, editors), Contemporary Mathematics, vol. 78, American Mathematical Society, Providence, 1988, pp. 705-730.
58. R. Zach, Completeness before Post: Bernays, Hilbert, and the development of propo-sitional logic, The Bulletin of Symbolic Logic, vol. 5 (1999), pp. 331-366.