Category theory for linear logicians

&
In Thomas Ehrhard, Linear logic in computer science. New York: Cambridge University Press. pp. 316--3 (2004)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,621

External links

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

Through your library

My notes

Similar books and articles

Z-modules and full completeness of multiplicative linear logic.Masahiro Hamano - 2001 - Annals of Pure and Applied Logic 107 (1-3):165-191.
Overview of linear logic programming.Dale Miller - 2004 - In Thomas Ehrhard, Linear logic in computer science. New York: Cambridge University Press. pp. 316--119.
Questions and answers–a category arising in linear logic, complexity theory, and set theory.Andreas Blass - 1995 - In Jean-Yves Girard, Yves Lafont & Laurent Regnier, Advances in linear logic. New York, NY, USA: Cambridge University Press. pp. 222--61.
Linear logic in computer science.Thomas Ehrhard (ed.) - 2004 - New York: Cambridge University Press.
Linear Logic in Computer Science.P. Scott - 2006 - Bulletin of Symbolic Logic 12 (2):297-299.
Linear logic in computer science. [REVIEW]Andrzej S. Murawski - 2006 - Bulletin of Symbolic Logic 12 (2):297-298.
Between logic and quantic: a tract.Jean-Yves Girard - 2004 - In Thomas Ehrhard, Linear logic in computer science. New York: Cambridge University Press. pp. 316--346.
Petri nets, Horn programs, Linear Logic and vector games.Max I. Kanovich - 1995 - Annals of Pure and Applied Logic 75 (1-2):107-135.
Scott Sentence Complexities of Linear Orderings.David Gonzalez & Dino Rossegger - forthcoming - Journal of Symbolic Logic:1-30.
A topological correctness criterion for non-commutative logic.Paul-André Mellies - 2004 - In Thomas Ehrhard, Linear logic in computer science. New York: Cambridge University Press. pp. 283--323.

Analytics

Added to PP
2014-01-28

Downloads
57 (#417,175)

6 months
4 (#1,007,739)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Category theory.Jean-Pierre Marquis - 2008 - Stanford Encyclopedia of Philosophy.
Abstract logical structuralism.Jean-Pierre Marquis - 2020 - Philosophical Problems in Science 69:67-110.
A comparison between monoidal and substructural logics.Clayton Peterson - 2016 - Journal of Applied Non-Classical Logics 26 (2):126-159.
Coherence in linear predicate logic.Kosta Došen & Zoran Petrić - 2009 - Annals of Pure and Applied Logic 158 (1-2):125-153.

View all 8 citations / Add more citations

References found in this work

No references found.

Add more references