05124nam 22008055 450 991014362160332120200706052321.03-540-45504-310.1007/3-540-45504-3(CKB)1000000000211580(SSID)ssj0000325964(PQKBManifestationID)11912741(PQKBTitleCode)TC0000325964(PQKBWorkID)10264894(PQKB)11447602(DE-He213)978-3-540-45504-2(MiAaPQ)EBC3072195(PPN)155182595(EXLCZ)99100000000021158020121227d2001 u| 0engurnn|008mamaatxtccrProof Theory in Computer Science[electronic resource] International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings /edited by Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (X, 246 p.) Lecture Notes in Computer Science,0302-9743 ;2183Bibliographic Level Mode of Issuance: Monograph3-540-42752-X Includes bibliographical references and index.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.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.Lecture Notes in Computer Science,0302-9743 ;2183Programming languages (Electronic computers)Mathematical logicArtificial intelligenceComputer logicAlgorithmsProgramming Languages, Compilers, Interpretershttps://scigraph.springernature.com/ontologies/product-market-codes/I14037Mathematical Logic and Foundationshttps://scigraph.springernature.com/ontologies/product-market-codes/M24005Artificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XAlgorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Programming 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.004/.01/5113Kahle Reinhardedthttp://id.loc.gov/vocabulary/relators/edtSchroeder-Heister Peteredthttp://id.loc.gov/vocabulary/relators/edtStärk Robertedthttp://id.loc.gov/vocabulary/relators/edtPTCS 2001MiAaPQMiAaPQMiAaPQBOOK9910143621603321Proof Theory in Computer Science2294850UNINA