000 04155nam a22006495i 4500
001 978-3-540-45504-2
003 DE-He213
005 20240423132442.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540455042
_9978-3-540-45504-2
024 7 _a10.1007/3-540-45504-3
_2doi
050 4 _aQA76.76.C65
072 7 _aUMC
_2bicssc
072 7 _aCOM010000
_2bisacsh
072 7 _aUMC
_2thema
082 0 4 _a005.45
_223
245 1 0 _aProof Theory in Computer Science
_h[electronic resource] :
_bInternational Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings /
_cedited by Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aX, 246 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2183
505 0 _aLinear 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.
520 _aProof 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 0 _aCompilers (Computer programs).
650 0 _aMathematical logic.
650 0 _aArtificial intelligence.
650 0 _aMachine theory.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 1 4 _aCompilers and Interpreters.
650 2 4 _aMathematical Logic and Foundations.
650 2 4 _aArtificial Intelligence.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aAlgorithms.
700 1 _aKahle, Reinhard.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSchroeder-Heister, Peter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aStärk, Robert.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540427520
776 0 8 _iPrinted edition:
_z9783662161753
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2183
856 4 0 _uhttps://doi.org/10.1007/3-540-45504-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187897
_d187897