Computer science logic : 18th international workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004 : proceedings

Computer Science Logic: 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004. Proceedings
Author: Jerzy Marcinkowski, Andrzej Tarlecki
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-23024-3
DOI: 10.1007/b100120

Table of Contents:

• Notions of Average-Case Complexity for Random 3-SAT
• Abstract Interpretation of Proofs: Classical Propositional Calculus
• Applications of Craig Interpolation to Model Checking
• Bindings, Mobility of Bindings, and the ∇-Quantifier: An Abstract
• My (Un)Favourite Things
• On Nash Equilibria in Stochastic Games
• A Bounding Quantifier
• Parity and Exploration Games on Infinite Graphs
• Integrating Equational Reasoning into Instantiation-Based Theorem Proving
• Goal-Directed Methods for Łukasiewicz Logic
• A General Theorem on Termination of Rewriting
• Predicate Transformers and Linear Logic: Yet Another Denotational Model
• Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
• On Proof Nets for Multiplicative Linear Logic with Units
• The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
• Game-Based Notions of Locality Over Finite Models
• Fixed Points of Type Constructors and Primitive Recursion
• On the Building of Affine Retractions
• Higher-Order Matching in the Linear λ-calculus with Pairing
• A Dependent Type Theory with Names and Binding

Includes bibliographical references and index