WorldCat Identities

Girard, Jean-Yves

Overview
Works: 49 works in 201 publications in 4 languages and 2,900 library holdings
Genres: Conference papers and proceedings  History 
Roles: Author, Editor, Thesis advisor, Other, Honoree, Creator, Interviewee, Opponent
Classifications: QA9, 510.1
Publication Timeline
.
Most widely held works by Jean-Yves Girard
Proofs and types by Jean-Yves Girard( Book )

21 editions published between 1989 and 1993 in English and held by 391 WorldCat member libraries worldwide

Advances in linear logic by Jean-Yves Girard( Book )

20 editions published between 1995 and 2003 in English and Undetermined and held by 297 WorldCat member libraries worldwide

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 Cornell University, in June 1993. Survey papers devoted to specific areas of linear logic, as well as an extensive general introduction to the subject by J.-Y. Girard, have been added, so as to make this book a valuable tool both for the beginner and for the advanced researcher
Typed lambda calculi and applications : 4th international conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999 : proceedings by Jean-Yves Girard( Book )

26 editions published between 1997 and 2002 in English and German and held by 260 WorldCat member libraries worldwide

This book constitutes the refereed proceedings of the 4th International Conference on Typed Lambda Calculi and Applications, TLCA'99, held in L'Aquila, Italy in April 1999. The 25 revised full papers presented were carefully reviewed and selected from a total of 50 submissions. Also included are two invited demonstrations. The volume reports research results on various aspects of typed lambda calculi. Among the topics addressed are noncommutative logics, type theory, algebraic data types, logical calculi, abstract data types, and subtyping
Proof theory and logical complexity by Jean-Yves Girard( Book )

8 editions published in 1987 in English and held by 177 WorldCat member libraries worldwide

"This long awaited book ... fills essential gaps in monographic literature on proof theory and prepares readers for volume 2 (to be published soon) containing an exposition of the author's new approach to proof theory for higher order logic. Even in traditional topics, like Gödel's completeness and incompleteness theorems, and cut elemination, accents are different compared to books by Kleene, Schütte, or Takeuti, which are strongly influenced by Hilbert's aim: to make mathematical theories (number theory, analysis etc.) more reliable by transformations of formalized proofs. The author is much closer to the approach of G. Kreisel (to whom this book is dedicated): Hilbert's program needs drastic rethinking and one of the main tasks is in finding mathematical applications of the results obtained in proof theory. Possibly, it is not a pure chance that the system of second order functionals developed by the author in his normalization proof for second order logic (was rediscovered and) became a tool in computer science. The book under review presents not only this material, but also other results by the author which became a part of modern proof theory including analysis of cut-free provability in terms of 3-valued logic. The material which was not previously covered (at least in such detail) in proof-theoretic monographs includes strong normalizability proofs (after Tait and Gandy), applications of reflection principles, recursive ordinals, operations on local correct (but not necessarily well-founded) omega-derivations, no-counterexample interpretation, using proof theory to extract combinatory estimates with a detailed treatment of van der Waerden's theorem. This is a difficult, but rewarding postgraduate-level textbook. The author does not avoid philosophical questions, and such discussion supported by theorems is certainly fruitful, although the reviewer would not agree with all author's conclusions"-- description of volume 1
Le point aveugle : cours de logique by Jean-Yves Girard( Book )

15 editions published between 2006 and 2014 in French and held by 149 WorldCat member libraries worldwide

La Machine de Turing by Alan Mathison Turing( Book )

7 editions published between 1995 and 1999 in French and held by 134 WorldCat member libraries worldwide

The blind spot : lectures on logic by Jean-Yves Girard( Book )

11 editions published in 2011 in English and held by 117 WorldCat member libraries worldwide

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 with Gödel's paradox (1931) - so to speak, the incompleteness of answers with respect to questions - the book proceeds with paradigms inherited from Gentzen's cut-elimination (1935). Various settings are studied: sequent calculus, natural deduction, lambda calculi, category-theoretic composition, up to geometry of interaction (GoI), all devoted to explicitation, which eventually amounts to inverting an operator in a von Neumann algebra. Mathematical language is usually described as referring to a preexisting reality. Logical operations can be given an alternative procedural meaning: typically, the operators involved in GoI are invertible, not because they are constructed according to the book, but because logical rules are those ensuring invertibility. Similarly, the durability of truth should not be taken for granted: one should distinguish between imperfect (perennial) and perfect modes. The procedural explanation of the infinite thus identifies it with the unfinished, i.e., the perennial. But is perenniality perennial? This questioning yields a possible logical explanation for algorithmic complexity. This highly original course on logic by one of the world's leading proof theorists challenges mathematicians, computer scientists, physicists and philosophers to rethink their views and concepts on the nature of mathematical knowledge in an exceptionally profound way
Le théorème de Gödel by Ernest Nagel( Book )

4 editions published between 1989 and 1997 in French and held by 63 WorldCat member libraries worldwide

En 1931, Kurt Godel démontrait, dans un article révolutionnaire, l'incomplétude de tout système axiomatique contenant la théorie des nombres. Apparemment très technique, ce théorème bouleversait de fond en comble la philosophie des mathématiques
Cinq conférences sur l'indécidabilité by Nicolas Bouleau( Book )

8 editions published in 1983 in French and held by 51 WorldCat member libraries worldwide

Proof theory and logical complexity by Jean-Yves Girard( Book )

1 edition published in 1987 in English and held by 31 WorldCat member libraries worldwide

Proof theory and logical complexity by Jean-Yves Girard( Book )

3 editions published in 1987 in English and Undetermined and held by 28 WorldCat member libraries worldwide

Gödel's proof by Ernest Nagel( Book )

3 editions published in 1992 in Italian and held by 23 WorldCat member libraries worldwide

"In 1931 Kurt Godel disrupted some of the fundamental assumptions underlying mathematics and logic with the publication of his revolutionary paper, "On Formally Undecidable Propositions of Principia Mathematica and Related Systems." Ironically, few mathematicians of the time were able to understand the young scholar's complex proof, and the full importance of this work was largely overlooked for many years. Godel was at last recognized by his peers and presented with the first Albert Einstein Award in 1951 for achievement in the natural sciences - the highest honor of its kind in the United States. The award committee, which included Albert Einstein and J. Robert Oppenheimer, described his work as "one of the greatest contributions to the sciences in recent times."" "In Godel's Proof, Ernest Nagel and James Newman provide a readable and non-technical explanation for both scholars and non-specialists of the main ideas and broad implications of Godel's discovery. First published in 1958 and in print continuously in ten languages, this highly popular, seminal work offers every educated person with an interest in mathematics, logic, and philosophy the opportunity to understand a previously difficult and inaccessible subject."--Jacket
Le fantôme de la transparence by Jean-Yves Girard( Book )

4 editions published in 2016 in French and held by 22 WorldCat member libraries worldwide

Proof theory and logical complexity by Jean-Yves Girard( Book )

5 editions published in 1987 in English and held by 16 WorldCat member libraries worldwide

Proof theory and logical complexity by Jean-Yves Girard( Book )

8 editions published in 1987 in English and held by 15 WorldCat member libraries worldwide

Les fondements des mathématiques by Jean-Yves Girard( Visual )

5 editions published between 2000 and 2005 in French and held by 14 WorldCat member libraries worldwide

La "crise des fondements" s'ouvre en 1897 avec le paradoxe de Burali-Forti, une contradiction dans la toute jeune théorie des Ensembles. Parmi les solutions proposées, le "Programme de Hilbert" (1925 environ) accorde un rôle privilégié à la non-contradiction formelle
Le point aveugle : cours de logique by Jean-Yves Girard( Book )

4 editions published between 2006 and 2007 in French and held by 10 WorldCat member libraries worldwide

Linear logic in computer science by Thomas Ehrhard( Book )

4 editions published in 2004 in English and held by 8 WorldCat member libraries worldwide

Linear Logic is a branch of proof theory which provides refined tools for the study of the computational aspects of proofs. These tools include a duality-based categorical semantics, an intrinsic graphical representation of proofs, the introduction of well-behaved non-commutative logical connectives, and the concepts of polarity and focalisation. These various aspects are illustrated here through introductory tutorials as well as more specialised contributions, with a particular emphasis on applications to computer science: denotational semantics, lambda-calculus, logic programming and concurrency theory. The volume is rounded-off by two invited contributions on new topics rooted in recent developments of linear logic. The book derives from a summer school that was the climax of the EU Training and Mobility of Researchers project 'Linear Logic in Computer Science '. It is an excellent introduction to some of the most active research topics in the area
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.65 (from 0.08 for Advances i ... to 0.93 for Proof theo ...)

Proofs and types
Alternative Names
Girard, J.-Y.

Girard, J.-Y. 1947-

Girard, J.-Y. (Jean-Yves)

Girard, Jean-Y. 1947-

Girard, Jean-Yves

Girard, Jean Yves 1947-

jan,iv.jirar

Jean-Yves Girard Frans wiskundige

Jean-Yves Girard fransk matematikar

Jean-Yves Girard fransk matematiker

Jean-Yves Girard französischer mathematischer Logiker

Jean-Yves Girard French logician

Жан-Ив Жирар французский математики и логик

ジャン=イヴ・ジラール

Languages
English (104)

French (47)

Italian (3)

German (1)

Covers
Advances in linear logicTyped lambda calculi and applications : 4th international conference, TLCA'99, L'Aquila, Italy, April 7-9, 1999 : proceedingsProof theory and logical complexityThe blind spot : lectures on logicProof theory and logical complexityProof theory and logical complexityProof theory and logical complexityProof theory and logical complexityLinear logic in computer science