LEADER 05407nam 22007695 450 001 9910484232903321 005 20230406011037.0 010 $a3-540-87531-X 024 7 $a10.1007/978-3-540-87531-4 035 $a(CKB)1000000000490433 035 $a(SSID)ssj0000316897 035 $a(PQKBManifestationID)11222005 035 $a(PQKBTitleCode)TC0000316897 035 $a(PQKBWorkID)10287113 035 $a(PQKB)10933274 035 $a(DE-He213)978-3-540-87531-4 035 $a(MiAaPQ)EBC3063508 035 $a(MiAaPQ)EBC6386389 035 $a(PPN)129062901 035 $a(EXLCZ)991000000000490433 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic $e22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008, Proceedings /$fedited by Michael Kaminski, Simone Martini 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XI, 513 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5213 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-87530-1 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- The Computability Path Ordering: The End of a Quest -- The Joy of String Diagrams -- Model Transformations in Decidability Proofs for Monadic Theories -- Molecules as Automata -- Contributed Papers -- An Infinite Automaton Characterization of Double Exponential Time -- Recursion Schemata for NC k -- Extensional Uniformity for Boolean Circuits -- Pure Pointer Programs with Iteration -- Quantified Positive Temporal Constraints -- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint -- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars -- Continuous Fragment of the mu-Calculus -- On the Relations between the Syntactic Theories of ??-Calculi -- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms -- Proving Infinitude of Prime Numbers Using Binomial Coefficients -- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic -- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) -- Quantitative Game Semantics for Linear Logic -- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic -- An Indexed System for Multiplicative Additive Polarized Linear Logic -- A Characterisation of Lambda Definability with Sums Via ???-Closure Operators -- Superposition for Fixed Domains -- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T -- On the Almighty Wand -- On Counting Generalized Colorings -- The Descriptive Complexity of Parity Games -- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games -- Quantitative Languages -- Characterization of Logics over Ranked Tree Languages -- The Nesting-Depth of Disjunctive ?-Calculus for Tree Languages and the Limitedness Problem -- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) -- Syntactic Metatheory of Higher-Order Subtyping -- On Isomorphisms of Intersection Types -- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence -- Type-Based Termination with Sized Products -- The Ackermann Session -- The Ackermann Award 2008. 330 $aThis book constitutes the refereed proceedings of the 22nd International Workshop on Computer Science Logic, CSL 2008, held as the 17th Annual Conference of the EACSL in Bertinoro, Italy, in September 2008. The 31 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from 102 submissions. All current aspects of logic in computer science are addressed, ranging from foundational and methodological issues to application issues of practical relevance. The book concludes with a presentation of this year's Ackermann award. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5213 606 $aComputer science 606 $aMachine theory 606 $aArtificial intelligence 606 $aMathematical logic 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aArtificial Intelligence 606 $aComputer Science Logic and Foundations of Programming 606 $aMathematical Logic and Foundations 615 0$aComputer science. 615 0$aMachine theory. 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 14$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aArtificial Intelligence. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aMathematical Logic and Foundations. 676 $a004.015113 702 $aKaminski$b Michael 702 $aMartini$b Simone 712 02$aEuropean Association for Computer Science Logic. 712 12$aCSL 2008 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484232903321 996 $aComputer Science Logic$9771972 997 $aUNINA