000 04826nam a22003855i 4500
001 298040
003 MX-SnUAN
005 20160429155445.0
007 cr nn 008mamaa
008 150903s2007 gw | o |||| 0|eng d
020 _a9783540749158
_99783540749158
024 7 _a10.1007/9783540749158
_2doi
035 _avtls000350985
039 9 _a201509030431
_bVLOAD
_c201405060243
_dVLOAD
_y201402171110
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA8.9-QA10.3
100 1 _aDuparc, Jacques.
_eeditor.
_9334126
245 1 0 _aComputer Science Logic :
_b21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007. Proceedings /
_cedited by Jacques Duparc, Thomas A. Henzinger.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2007.
300 _axiv, 600 páginas Also available online.
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4646
500 _aSpringer eBooks
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-Parameter Tractability: 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.
520 _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, in September 2007. The 36 revised full papers presented together with the abstracts of 6 invited lectures were carefully reviewed and selected from 116 submissions. The papers 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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aHenzinger, Thomas A.
_eeditor.
_9334127
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540749141
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-74915-8
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c298040
_d298040