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...
Gorde:
| Egile nagusia: | |
|---|---|
| Beste egile batzuk: | , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
2183 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
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 |
Aurkibidea:
- 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.