Switch to: Citations

Add references

You must login to add references.
  1. Category theory for linear logicians.Richard Blute & Philip Scott - 2004 - In Thomas Ehrhard (ed.), Linear logic in computer science. New York: Cambridge University Press. pp. 316--3.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • On the semantics of the universal quantifier.Djordje Čubrić - 1997 - Annals of Pure and Applied Logic 87 (3):209-239.
    We investigate the universal fragment of intuitionistic logic focussing on equality of proofs. We give categorical models for that and prove several completeness results. One of them is a generalization of the well known Yoneda lemma and the other is an extension of Harvey Friedman's completeness result for typed lambda calculus.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the semantics of the universal quantifier.Djordje Ubri - 1997 - Annals of Pure and Applied Logic 87 (3):209-239.
    We investigate the universal fragment of intuitionistic logic focussing on equality of proofs. We give categorical models for that and prove several completeness results. One of them is a generalization of the well known Yoneda lemma and the other is an extension of Harvey Friedman's completeness result for typed lambda calculus.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Hyperdoctrines, Natural Deduction and the Beck Condition.Robert A. G. Seely - 1983 - Mathematical Logic Quarterly 29 (10):505-542.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Predicate functors revisited.W. V. Quine - 1981 - Journal of Symbolic Logic 46 (3):649-652.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Maps II: Chasing Diagrams in Categorical Proof Theory.Dusko Pavlovic - 1996 - Logic Journal of the IGPL 4 (2):159-194.
    In categorical proof theory, propositions and proofs are presented as objects and arrows in a category. It thus embodies the strong constructivist paradigms of propositions-as-types and proofs-as-construtions, which lie in the foundation of computational logic. Moreover, in the categorical setting, a third paradigrn arises, not available elsewhere: logical-operations-as-adjunctions. It offers an answer to the notorious question of the equality of proofs. So we chase diagrams in algebra of proofs.On the basis of these ideas, the present paper investigates proof theory of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Adjointness in Foundations.F. William Lawvere - 1969 - Dialectica 23 (3‐4):281-296.
    Download  
     
    Export citation  
     
    Bookmark   75 citations  
  • Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.
    Download  
     
    Export citation  
     
    Bookmark   127 citations