LEADER 04051nam 2200577Ia 450 001 9910482993203321 005 20200520144314.0 010 $a1-280-38839-0 010 $a9786613566317 010 $a3-642-15205-8 024 7 $a10.1007/978-3-642-15205-4 035 $a(CKB)2670000000036387 035 $a(SSID)ssj0000446371 035 $a(PQKBManifestationID)11299745 035 $a(PQKBTitleCode)TC0000446371 035 $a(PQKBWorkID)10495814 035 $a(PQKB)10017386 035 $a(DE-He213)978-3-642-15205-4 035 $a(MiAaPQ)EBC3065678 035 $a(PPN)149018045 035 $a(EXLCZ)992670000000036387 100 $a20100709d2010 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer science logic $e24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010 ; proceedings /$fAnuj Dawar, Helmut Veith (eds.) 205 $a1st ed. 2010. 210 $aBerlin ;$aNew York $cSpringer$dc2010 215 $a1 online resource (XIV, 548 p. 64 illus.) 225 1 $aLecture notes in computer science ;$v6247 300 $aIncludes index. 311 $a3-642-15204-X 327 $aInvited Talks -- Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries -- Definability in Games -- From Feasible Proofs to Feasible Computations -- Tree Dualities for Constraint Satisfaction -- Ordered Sets in the Calculus of Data Structures -- Abductive, Inductive and Deductive Reasoning about Resources -- Constraint Solving for Program Verification: Theory and Practice by Example -- Contributed Papers -- Tableau Calculi for over minspaces -- A Resolution Mechanism for Prenex Gödel Logic -- Efficient Enumeration for Conjunctive Queries over X-underbar Structures -- A Formalisation of the Normal Forms of Context-Free Grammars in HOL4 -- Automata vs. Logics on Data Words -- Graded Computation Tree Logic with Binary Coding -- Exact Exploration and Hanging Algorithms -- Embedding Deduction Modulo into a Prover -- Exponentials with Infinite Multiplicities -- Classical and Intuitionistic Subexponential Logics Are Equally Expressive -- On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT -- A Logic of Sequentiality -- Environment and Classical Channels in Categorical Quantum Mechanics -- Formal Theories for Linear Algebra -- Energy and Mean-Payoff Games with Imperfect Information -- Randomisation and Derandomisation in Descriptive Complexity Theory -- Towards a Canonical Classical Natural Deduction System -- Coordination Logic -- Second-Order Equational Logic (Extended Abstract) -- Fibrational Induction Rules for Initial Algebras -- A Sequent Calculus with Implicit Term Representation -- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures -- The Structural ?-Calculus -- The Isomorphism Problem for ?-Automatic Trees -- Complexity Results for Modal Dependence Logic -- The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case -- On the Computability of Region-Based Euclidean Logics -- Inductive-Inductive Definitions -- Quantified Differential Dynamic Logic for Distributed Hybrid Systems -- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic -- Two-Variable Logic with Two Order Relations -- Signature Extensions Preserve Termination -- Coq Modulo Theory -- Ackermann Award -- The Ackermann Award 2010. 410 0$aLecture notes in computer science ;$v6247. 606 $aComputer logic 606 $aLogic, Symbolic and mathematical 615 0$aComputer logic. 615 0$aLogic, Symbolic and mathematical. 676 $a004.015113 701 $aDawar$b Anuj$01753704 701 $aVeith$b Helmut$01753705 712 12$aCSL 2010 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910482993203321 996 $aComputer science logic$94189686 997 $aUNINA