Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008872448/catalog> ?p ?o. }

• catalog abstract "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.".
• catalog contributor b12452711.
• catalog contributor b12452712.
• catalog contributor b12452713.
• catalog contributor b12452714.
• catalog created "c2001.".
• catalog date "2001".
• catalog date "c2001.".
• catalog dateCopyrighted "c2001.".
• catalog description "Includes bibliographical references and index.".
• catalog description "Linear ramified higher type recursion and parallel complexity / Klaus Aehlig . [and others] -- Reflective [lambda]-calculus / Jesse Alt and Sergei Artemov -- A note on the proof-theoretic strength of a single application of the schema of identity / Matthias Baaz and Christian G. Fermuller -- Comparing the complexity of cut-elimination methods / Matthias Baaz and Alexander Leitsch -- Program extraction from Gentzen's proof of transfinite induction up to [epsilon]₀ / Ulrich Berger -- Coherent bicartesian and sesquicartesian categories / Kosta Dosen and Zoran Petric -- Indexed induction-recursion / Peter Dybjer and Anton Setzer -- Modeling meta-logical features in a calculus with frozen variables / Birgit Elbl -- Proof theory and post-turing analysis / Lew Gordeew -- Interpolation for natural deduction with generalized eliminations / Ralph Matthes -- Implicit characterizations of Pspace / Isabel Oitavem -- Iterate logic / Peter H. Schmitt -- Constructive foundations for featherweight Java / Thomas Studer.".
• catalog description "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.".
• catalog extent "viii, 238 p. :".
• catalog identifier "354042752X (softcover : alk. paper)".
• catalog isPartOf "Lecture notes in computer science ; 2183".
• catalog issued "2001".
• catalog issued "c2001.".
• catalog language "eng".
• catalog publisher "Berlin ; New York : Springer,".
• catalog subject "004/.01/5113 21".
• catalog subject "Artificial intelligence.".
• catalog subject "Automatic theorem proving Congresses.".
• catalog subject "Computer science.".
• catalog subject "Computer software.".
• catalog subject "Logic design.".
• catalog subject "Logic, Symbolic and mathematical.".
• catalog subject "QA76.9.A96 P753 2001".
• catalog tableOfContents "Linear ramified higher type recursion and parallel complexity / Klaus Aehlig . [and others] -- Reflective [lambda]-calculus / Jesse Alt and Sergei Artemov -- A note on the proof-theoretic strength of a single application of the schema of identity / Matthias Baaz and Christian G. Fermuller -- Comparing the complexity of cut-elimination methods / Matthias Baaz and Alexander Leitsch -- Program extraction from Gentzen's proof of transfinite induction up to [epsilon]₀ / Ulrich Berger -- Coherent bicartesian and sesquicartesian categories / Kosta Dosen and Zoran Petric -- Indexed induction-recursion / Peter Dybjer and Anton Setzer -- Modeling meta-logical features in a calculus with frozen variables / Birgit Elbl -- Proof theory and post-turing analysis / Lew Gordeew -- Interpolation for natural deduction with generalized eliminations / Ralph Matthes -- Implicit characterizations of Pspace / Isabel Oitavem -- Iterate logic / Peter H. Schmitt -- Constructive foundations for featherweight Java / Thomas Studer.".
• catalog title "Proof theory in computer science : international seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001 : proceedings / Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk (eds.).".
• catalog type "Conference proceedings. fast".
• catalog type "Dagstuhl (2001) swd".
• catalog type "text".