04051nam 2200577Ia 450 991048299320332120200520144314.01-280-38839-097866135663173-642-15205-810.1007/978-3-642-15205-4(CKB)2670000000036387(SSID)ssj0000446371(PQKBManifestationID)11299745(PQKBTitleCode)TC0000446371(PQKBWorkID)10495814(PQKB)10017386(DE-He213)978-3-642-15205-4(MiAaPQ)EBC3065678(PPN)149018045(EXLCZ)99267000000003638720100709d2010 uy 0engurnn|008mamaatxtccrComputer science logic 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010 ; proceedings /Anuj Dawar, Helmut Veith (eds.)1st ed. 2010.Berlin ;New York Springerc20101 online resource (XIV, 548 p. 64 illus.) Lecture notes in computer science ;6247Includes index.3-642-15204-X Invited 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.Lecture notes in computer science ;6247.Computer logicLogic, Symbolic and mathematicalComputer logic.Logic, Symbolic and mathematical.004.015113Dawar Anuj1753704Veith Helmut1753705CSL 2010MiAaPQMiAaPQMiAaPQBOOK9910482993203321Computer science logic4189686UNINA