LEADER 04475nam 2200577 a 450 001 9910484744203321 005 20200520144314.0 024 7 $a10.1007/11538363 035 $a(CKB)1000000000213183 035 $a(SSID)ssj0000316899 035 $a(PQKBManifestationID)11237046 035 $a(PQKBTitleCode)TC0000316899 035 $a(PQKBWorkID)10288390 035 $a(PQKB)11431523 035 $a(DE-He213)978-3-540-31897-2 035 $a(MiAaPQ)EBC3067782 035 $a(PPN)123096731 035 $a(EXLCZ)991000000000213183 100 $a20050707d2005 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer science logic $e19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005 : proceedings /$fLuke Ong (ed.) 205 $a1st ed. 2005. 210 $aBerlin $cSpringer$d2005 215 $a1 online resource (XI, 567 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3634 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$aPrinted edition: 9783540282310 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- XML Navigation and Tarski?s Relation Algebras -- Verification in Predicate Logic with Time: Algorithmic Questions -- Note on Formal Analogical Reasoning in the Juridical Context -- An Abstract Strong Normalization Theorem -- Semantics and Logics -- On Bunched Polymorphism -- Distributed Control Flow with Classical Modal Logic -- A Logic of Coequations -- A Semantic Formulation of ???-Lifting and Logical Predicates for Computational Metalanguage -- Type Theory and Lambda Calculus -- Order Structures on Böhm-Like Models -- Higher-Order Matching and Games -- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations -- On the Role of Type Decorations in the Calculus of Inductive Constructions -- Linear Logic and Ludics -- L-Nets, Strategies and Proof-Nets -- Permutative Logic -- Focusing the Inverse Method for Linear Logic -- Towards a Typed Geometry of Interaction -- Constraints -- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction -- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints -- Finite Models, Decidability and Complexity -- Coprimality in Finite Models -- Towards a Characterization of Order-Invariant Queries over Tame Structures -- Decidability of Term Algebras Extending Partial Algebras -- Results on the Guarded Fragment with Equivalence or Transitive Relations -- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic -- On the Complexity of Hybrid Logics with Binders -- The Complexity of Independence-Friendly Fixpoint Logic -- Closure Properties of Weak Systems of Bounded Arithmetic -- Verification and Model Checking -- Transfinite Extension of the Mu-Calculus -- Bounded Model Checking of Pointer Programs -- PDL with Intersection and Converse Is Decidable -- On Deciding Topological Classes of Deterministic Tree Languages -- Constructive Reasoning and Computational Mathematics -- Complexity and Intensionality in a Type-1 Framework for Computable Analysis -- Computing with Sequences, Weak Topologies and the Axiom of Choice -- Light Functional Interpretation -- Feasible Proofs of Matrix Properties with Csanky?s Algorithm -- Implicit Computational Complexity and Rewriting -- A Propositional Proof System for Log Space -- Identifying Polynomial-Time Recursive Functions -- Confluence of Shallow Right-Linear Rewrite Systems -- Appendices -- The Ackermann Award 2005 -- Clemens Lautemann: 1951-2005 An Obituary. 410 0$aLecture notes in computer science ;$v3634. 517 3 $aCSL 2005 517 3 $a14th Annual Conference of the EACSL 517 3 $aFourteenth Annual Conference of the EACSL 517 3 $aConference of the EACSL 606 $aComputer logic$vCongresses 615 0$aComputer logic 676 $a005.1/015113 701 $aOng$b Luke$01752473 712 02$aEuropean Association for Computer Science Logic.$bConference$d(14th :$f2005 :$eOxford, England) 712 12$aWorkshop on Computer Science Logic 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484744203321 996 $aComputer science logic$94187794 997 $aUNINA