Proof Theory in Computer Science International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Kahle, Reinhard (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Schroeder-Heister, Peter (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Stärk, Robert (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2183
• Θέματα: Programming languages (Electronic computers).; Mathematical logic.; Artificial intelligence.; Computer logic.; Algorithms.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Foundations.; Artificial Intelligence.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Algorithm Analysis and Problem Complexity.

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...

Πίνακας περιεχομένων:

• 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.