000 05019nam a22006015i 4500
001 978-3-540-74915-8
003 DE-He213
005 20240730194844.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540749158
_9978-3-540-74915-8
024 7 _a10.1007/978-3-540-74915-8
_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 _aComputer Science Logic
_h[electronic resource] :
_b21 International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings /
_cedited by Jacques Duparc, Thomas A. Henzinger.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXIV, 600 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4646
505 0 _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.
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9158240
650 0 _aArtificial intelligence.
_93407
650 0 _aMathematical logic.
_92258
650 1 4 _aCompilers and Interpreters.
_931853
650 2 4 _aTheory of Computation.
_9158241
650 2 4 _aFormal Languages and Automata Theory.
_9158242
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aMathematical Logic and Foundations.
_934712
700 1 _aDuparc, Jacques.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9158243
700 1 _aHenzinger, Thomas A.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9158244
710 2 _aSpringerLink (Online service)
_9158245
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540749141
776 0 8 _iPrinted edition:
_z9783540843771
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4646
_9158246
856 4 0 _uhttps://doi.org/10.1007/978-3-540-74915-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95356
_d95356