Proof theory in computer science : ; proceedings international seminar, PTCS 2001, Dagstuhl Castle, Germany, Ocotober 7-12, 2001
Proof theory has long been established as a basic discipline of mathematical logic. It has recently become increasingly relevant to computer science. The - ductive apparatus provided by proof theory has proved useful for metatheoretical purposes as well as for practical applications. Thus it seemed...
保存先:
| 第一著者: | |
|---|---|
| その他の著者: | , |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
2183 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Proof theory in computer science, international seminar, PTCS 2001, Dagstuhl Castle, Germany, Ocotober 7-12, 2001, Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk (eds.), Berlin, Springer, 2001, 1 vol. (VIII-238 p.), Lecture notes in computer science, 3-540-42752-X • Proof Theory in Computer Science, Texte imprimé, 9783662161753 |
| LEADER | 04231nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 948701 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155182595 | ||
| 020 | |a 9783540455042 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004.015113 | ||
| 082 | |a 004 | ||
| 100 | 1 | |a Kahle, Reinhard, |d 1967- | |
| 245 | 1 | 0 | |a Proof theory in computer science : ; proceedings |b international seminar, PTCS 2001, Dagstuhl Castle, Germany, Ocotober 7-12, 2001 |c [edited by] Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2183 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Linear Ramified Higher Type Recursion and Parallel Complexity -- Reflective ?-Calculus -- A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity -- Comparing the Complexity of Cut-Elimination Methods -- Program Extraction from Gentzen s Proof of Transfinite Induction up to ?0 -- Coherent Bicartesian and Sesquicartesian Categories -- Indexed Induction-Recursion -- Modeling Meta-logical Features in a Calculus with Frozen Variables -- Proof Theory and Post-turing Analysis -- Interpolation for Natural Deduction with Generalized Eliminations -- Implicit Characterizations of Pspace -- Iterate logic -- Constructive Foundations for Featherweight Java. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a Proof theory has long been established as a basic discipline of mathematical logic. It has recently become increasingly relevant to computer science. The - ductive apparatus provided by proof theory has proved useful for metatheoretical purposes as well as for practical applications. Thus it seemed to us most natural to bring researchers together to assess both the role proof theory already plays in computer science and the role it might play in the future. The form of a Dagstuhl seminar is most suitable for purposes like this, as Schloß Dagstuhl provides a very convenient and stimulating environment to - scuss new ideas and developments. To accompany the conference with a proc- dings volume appeared to us equally appropriate. Such a volume not only ?xes basic results of the subject and makes them available to a broader audience, but also signals to the scienti?c community that Proof Theory in Computer Science (PTCS) is a major research branch within the wider ?eld of logic in computer science. | ||
| 650 | |a Informatique | ||
| 650 | |a Théorie de la démonstration | ||
| 650 | |a Algorithmes | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Stärk, Robert F., |d 1963- |4 pbd | |
| 700 | 1 | |a Schroeder-Heister, Peter Joseph, |d 1953- |4 pbd | |
| 776 | 0 | |0 058907424 |t Proof theory in computer science |o international seminar, PTCS 2001, Dagstuhl Castle, Germany, Ocotober 7-12, 2001 |f Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk (eds.) |c Berlin |n Springer |d 2001 |p 1 vol. (VIII-238 p.) |s Lecture notes in computer science |z 3-540-42752-X | |
| 776 | 0 | |t Proof Theory in Computer Science |b Texte imprimé |z 9783662161753 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45504-3 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-C29471TN-8 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:748062262 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45504-3 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:75151389X |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45504-3 |z Accès INSA CVL | |
| 997 | |0 948701 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||