Coherence in cartesian closed categories and the generality of proofs

Studia Logica 48 (3):285 - 297 (1989)
  Copy   BIBTEX

Abstract

We introduce the notion of an alphabetic trace of a cut-free intuitionistic prepositional proof and show that it serves to characterize the equality of arrows in cartesian closed categories. We also show that alphabetic traces improve on the notion of the generality of proofs proposed in the literature. The main theorem of the paper yields a new and considerably simpler solution of the coherence problem for cartesian closed categories than those in [11, 14].

Links

PhilArchive



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

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

The logic of bunched implications.Peter W. O'Hearn & David J. Pym - 1999 - Bulletin of Symbolic Logic 5 (2):215-244.
Coherence in substructural categories.Zoran Petrić - 2002 - Studia Logica 70 (2):271 - 296.
Bicartesian coherence.Kosta Došen & Zoran Petrić - 2002 - Studia Logica 71 (3):331 - 353.
Identity of proofs based on normalization and generality.Kosta Došen - 2003 - Bulletin of Symbolic Logic 9 (4):477-503.
A general notion of realizability.Lars Birkedal - 2002 - Bulletin of Symbolic Logic 8 (2):266-282.
The categories and the principle of coherence: Whitehead's theory of categories in historical perspective.Abraham Zvie Bar-on - 1987 - Hingham, MA, USA: Distributors for the USA and Canada, Kluwer Academic. Edited by Abraham Zvie Bar-On.

Analytics

Added to PP
2009-01-28

Downloads
30 (#517,657)

6 months
10 (#257,583)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bicartesian coherence.Kosta Došen & Zoran Petrić - 2002 - Studia Logica 71 (3):331 - 353.

Add more citations

References found in this work

A categorical equivalence of proofs.Manfred E. Szabo - 1974 - Notre Dame Journal of Formal Logic 15 (2):177-191.
A cut elimination theorem for stationary logic.M. E. Szabo - 1987 - Annals of Pure and Applied Logic 33 (C):181-193.
The continuous realizability of entailment.M. E. Szabo - 1983 - Mathematical Logic Quarterly 29 (4):219-233.

Add more references