LEADER 06042nam 22008415 450 001 9910483579203321 005 20251226200332.0 010 $a3-540-74915-2 024 7 $a10.1007/978-3-540-74915-8 035 $a(CKB)1000000000490434 035 $a(SSID)ssj0000316896 035 $a(PQKBManifestationID)11923506 035 $a(PQKBTitleCode)TC0000316896 035 $a(PQKBWorkID)10286909 035 $a(PQKB)10306914 035 $a(DE-He213)978-3-540-74915-8 035 $a(MiAaPQ)EBC3063447 035 $a(MiAaPQ)EBC6284028 035 $a(PPN)123165067 035 $a(MiAaPQ)EBC337381 035 $a(BIP)32372743 035 $a(BIP)14496020 035 $a(EXLCZ)991000000000490434 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic $e21 International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings /$fedited by Jacques Duparc, Thomas A. Henzinger 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XIV, 600 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4646 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-74914-4 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract) -- The Symbolic Approach to Repeated Games (Abstract) -- Proofs, Programs and Abstract Complexity -- Model-Checking First-Order Logic: Automata and Locality -- Tightening the Exchange Rates Between Automata -- Precise Relational Invariants Through Strategy Iteration -- Logic and Games -- Omega-Regular Half-Positional Winning Conditions -- Clique-Width and Parity Games -- Logical Refinements of Church?s Problem -- The Power of Counting Logics on Restricted Classes of Finite Structures -- Expressiveness -- Comparing the Expressive Power of Well-Structured Transition Systems -- There Exist Some ?-Powers of Any Borel Rank -- Games and Trees -- Satisfiability of a Spatial Logic with Tree Variables -- Forest Expressions -- MSO on the Infinite Binary Tree: Choice and Order -- Logic and Deduction -- Classical and Intuitionistic Logic Are Asymptotically Identical -- Qualitative Temporal and Spatial Reasoning Revisited -- On Acyclic Conjunctive Queries and Constant Delay Enumeration -- Integrating Linear Arithmetic into Superposition Calculus -- Lambda Calculus 1 -- The Theory of Calculi with Explicit Substitutions Revisited -- A Soft Type Assignment System for ?-Calculus -- Lambda Theories of Effective Lambda Models -- Typed Normal Form Bisimulation -- Lambda Calculus 2 -- Not Enough Points Is Enough -- Classical Program Extraction in the Calculus of Constructions -- Building Decision Procedures in the Calculus of Inductive Constructions -- Finite Model Theory -- Structure Theorem and Strict Alternation Hierarchy for FO2 on Words -- On the Complexity of Reasoning About Dynamic Policies -- Relativizing Small Complexity Classes and Their Theories -- Subexponential Time and Fixed-ParameterTractability: Exploiting the Miniaturization Mapping -- Linear Logic -- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic -- Linear Realizability -- Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete -- Focusing and Polarization in Intuitionistic Logic -- Proof Theory -- Incorporating Tables into Proofs -- A Cut-Free and Invariant-Free Sequent Calculus for PLTL -- Unbounded Proof-Length Speed-Up in Deduction Modulo -- Propositional Logic for Circuit Classes -- Game Characterizations and the PSPACE-Completeness of Tree Resolution Space -- Game Semantics -- Continuous Previsions -- Bad Variables Under Control -- A Games Model of Bunched Implications -- The Ackermann Award 2007. 330 $aThis book constitutes the refereed proceedings of the 21st International Workshop on Computer Science Logic, CSL 2007, held as the 16th Annual Conference of the EACSL in Lausanne, Switzerland. The 36 revised full papers presented together with the abstracts of six invited lectures are organized in topical sections on logic and games, expressiveness, games and trees, logic and deduction, lambda calculus, finite model theory, linear logic, proof theory, and game semantics. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4646 606 $aCompilers (Computer programs) 606 $aComputer science 606 $aMachine theory 606 $aArtificial intelligence 606 $aMathematical logic 606 $aCompilers and Interpreters 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$aCompilers (Computer programs). 615 0$aComputer science. 615 0$aMachine theory. 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 14$aCompilers and Interpreters. 615 24$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 $aDuparc$b Jacques$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHenzinger$b Thomas A$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aEuropean Association for Computer Science Logic. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483579203321 996 $aComputer Science Logic$9771972 997 $aUNINA