28 found
Order:
  1.  6
    Proofs and types.Jean-Yves Girard - 1989 - New York: Cambridge University Press.
    This text is an outgrowth of notes prepared by J. Y. Girard for a course at the University of Paris VII. It deals with the mathematical background of the application to computer science of aspects of logic (namely the correspondence between proposition & types). Combined with the conceptual perspectives of Girard's ideas, this sheds light on both the traditional logic material & its prospective applications to computer science. The book covers a very active & exciting research area, & it will (...)
    Direct download  
     
    Export citation  
     
    Bookmark   58 citations  
  2. Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.
    No categories
     
    Export citation  
     
    Bookmark   127 citations  
  3.  10
    [product]¹2-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   51 citations  
  4.  8
    Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2-3):75-219.
  5.  12
    Proof Theory and Logical Complexity.Helmut Pfeifer & Jean-Yves Girard - 1989 - Journal of Symbolic Logic 54 (4):1493.
  6. Linear logic: its syntax and semantics.Jean-Yves Girard - 1995 - In Jean-Yves Girard, Yves Lafont & Laurent Regnier (eds.), Advances in linear logic. New York, NY, USA: Cambridge University Press. pp. 222--1.
     
    Export citation  
     
    Bookmark   29 citations  
  7.  15
    On the unity of logic.Jean-Yves Girard - 1993 - Annals of Pure and Applied Logic 59 (3):201-217.
    We present a single sequent calculus common to classical, intuitionistic and linear logics. The main novelty is that classical, intuitionistic and linear logics appear as fragments, i.e. as particular classes of formulas and sequents. For instance, a proof of an intuitionistic formula A may use classical or linear lemmas without any restriction: but after cut-elimination the proof of A is wholly intuitionistic, what is superficially achieved by the subformula property and more deeply by a very careful treatment of structural rules. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  8.  6
    The Blind Spot: Lectures on Logic.Jean-Yves Girard - 2011 - Zurich, Switzerland: European Mathematical Society.
    These lectures on logic, more specifically proof theory, are basically intended for postgraduate students and researchers in logic. The question at stake is the nature of mathematical knowledge and the difference between a question and an answer, i.e., the implicit and the explicit. The problem is delicate mathematically and philosophically as well: the relation between a question and its answer is a sort of equality where one side is ``more equal than the other'': one thus discovers essentialist blind spots. Starting (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  9.  5
    Locus Solum: From the Rules of Logic to the Logic of Rules.Jean-Yves Girard - 2001 - Mathematical Structures in Computer Science 11 (3):301–506.
    Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where all things start (… ) An-Fang was near a city, the only living city with a pre-atomic name (… ) The headquarters of the People Programmer was at An-Fang, and there the mistake happened: A ruby trembled. Two tourmaline nets failed to rectify the laser beam. A diamond noted the error. Both the error and the correction went into the general computer. Cordwainer SmithThe Dead Lady (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  10.  5
    Introduction to?2 1 -logic.Jean-Yves Girard - 1985 - Synthese 62 (2):191-216.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  11.  2
    Set recursion and Πhalf-logic.Jean-Yves Girard & Dag Normann - 1985 - Annals of Pure and Applied Logic 28 (3):255-286.
  12.  6
    Introduction to ?2 1 -logic.Jean-Yves Girard - 1985 - Synthese 62 (2):191-216.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  13.  4
    From foundations to ludics.Jean-Yves Girard - 2003 - Bulletin of Symbolic Logic 9 (2):131-168.
    Ludics [1] is a novel approach to logic—especially proof-theory. The present introduction emphasises foundational issues.For ages, not a single disturbing idea in the area of “foundations”: the discussion is sort of ossified—as if everything had been said, as if all notions had taken their definite place, in a big cemetery of ideas. One can still refresh the flowers or regild the stone, e.g., prove technicalities, sometimes non-trivial; but the real debate is still: this paper begins with an autopsy, the autopsy (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  14.  12
    Normal functors, power series and lambda-calculus.Jean-Yves Girard - 1988 - Annals of Pure and Applied Logic 37 (2):129.
  15.  4
    Advances in linear logic.Jean-Yves Girard, Yves Lafont & Laurent Regnier (eds.) - 1995 - New York, NY, USA: Cambridge University Press.
    Linear logic, introduced in 1986 by J.-Y. Girard, is based upon a fine grain analysis of the main proof-theoretical notions of logic. The subject develops along the lines of denotational semantics, proof nets and the geometry of interaction. Its basic dynamical nature has attracted computer scientists, and various promising connections have been made in the areas of optimal program execution, interaction nets and knowledge representation. This book is the refereed proceedings of the first international meeting on linear logic held at (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  16. Between logic and quantic: a tract.Jean-Yves Girard - 2004 - In Thomas Ehrhard (ed.), Linear logic in computer science. New York: Cambridge University Press. pp. 316--346.
  17.  8
    Functors and ordinal notations. I: A functorial construction of the veblen hierarchy.Jean-Yves Girard & Jacqueline Vauzeilles - 1984 - Journal of Symbolic Logic 49 (3):713-729.
  18. Multiplicatives.Jean-Yves Girard - 1987 - In G. Lolli (ed.), Logic and Computer Science: New Trends and Applications. Rosenberg & Sellier. pp. 11--34.
    No categories
     
    Export citation  
     
    Bookmark   2 citations  
  19.  17
    2001 annual meeting of the association for symbolic logic.Joan Feigenbaum, Haim Gaifman, Jean-Yves Girard, C. Ward Henson, Denis Hirschfeldt, Carl G. Jockusch Jr, Saul Kripke, Salma Kuhlmann, John C. Mitchell & Ernest Schimmerling - 2001 - Bulletin of Symbolic Logic 7 (3):420-435.
  20.  15
    Some Uses of Dilators in Combinatorial Problems. II.V. Michele Abrusci, Jean-Yves Girard & Jacques van de Wiele - 1990 - Journal of Symbolic Logic 55 (1):32 - 40.
    We study increasing F-sequences, where F is a dilator: an increasing F-sequence is a sequence (indexed by ordinal numbers) of ordinal numbers, starting with 0 and terminating at the first step x where F(x) is reached (at every step x + 1 we use the same process as in decreasing F-sequences, cf. [2], but with "+ 1" instead of "- 1"). By induction on dilators, we shall prove that every increasing F-sequence terminates and moreover we can determine for every dilator (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  21. 2003 european summer meeting of the association for symbolic logic logic colloquim'03.Michael Benedikt, Stevo Todorcevic, Alexandru Baltag, Howard Becker, Matthew Foreman, Jean-Yves Girard, Martin Grohe, Peter T. Johnstone, Simo Knuuttila & Menachem Kojman - 2004 - Bulletin of Symbolic Logic 10 (2).
  22.  2
    A result on implications of Σ1-sentences and its application to normal form theorems.Jean-Yves Girard & Peter Päppinghaus - 1981 - Journal of Symbolic Logic 46 (3):634 - 642.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  23.  26
    Embeddability of ptykes.Jean-Yves Girard & Dag Normann - 1992 - Journal of Symbolic Logic 57 (2):659-676.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  24.  9
    Functors and Ordinal Notations. II: A Functorial Construction of the Bachmann Hierarchy.Jean-Yves Girard & Jacqueline Vauzeilles - 1984 - Journal of Symbolic Logic 49 (4):1079 - 1114.
  25.  2
    Le fantôme de la transparence.Jean-Yves Girard - 2016 - Paris: Éditions Allia.
    L'expérience de la connaissance nous enseigne qu'il n'y a pas de Réalité Dernière, que tout train en cache un autre. Une évidence qu'il n'est pas facile d'accepter, d'où l'idée de ce train ultime, celui qui ne cacherait plus rien. La transparentisme postule l'existence, au-delà de la perception immédiate, d'un monde, d'un niveau de lecture, complètement intelligible, i.e, explicite et immédiat. D'où cette croyance en de prétendus "rayons X du savoir" qui nous dévoileraient l'envers de l'Univers.
    Direct download  
     
    Export citation  
     
    Bookmark  
  26.  3
    Le Fantôme de La Transparence.Jean-Yves Girard - 2007 - Paris: Éditions Allia.
    L'expérience de la connaissance nous enseigne qu'il n'y a pas de Réalité Dernière, que tout train en cache un autre. Une évidence qu'il n'est pas facile d'accepter, d'où l'idée de ce train ultime, celui qui ne cacherait plus rien. La transparentisme postule l'existence, au-delà de la perception immédiate, d'un monde, d'un niveau de lecture, complètement intelligible, i.e, explicite et immédiat. D'où cette croyance en de prétendus "rayons X du savoir" qui nous dévoileraient l'envers de l'Univers.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  27. Logic: Its syntax and semantics.Jean-Yves Girard - 1995 - In Jean-Yves Girard, Yves Lafont & Laurent Regnier (eds.), Advances in linear logic. New York, NY, USA: Cambridge University Press.
     
    Export citation  
     
    Bookmark  
  28. Les premiers récursivement inaccessible et Mahlo et la théorie des dilatateurs.Jacqueline Vauzeilles & Jean-Yves Girard - 1985 - Archive for Mathematical Logic 24:167-191.
    Dans cet article, on utilise la théorie des dilatateurs pour décrire les premiers récursivement inaccessible et Mahlo.
    No categories
     
    Export citation  
     
    Bookmark