Computer Science Logic: 17th International Workshop CSL 2003, 12th Annual Conference of the EACSL, 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003. Proceedings

Front Matter....Pages -
Deciding Monotonic Games....Pages 1-14
The Commuting V-Diagram....Pages 15-28
Concurrent Construction of Proof-Nets....Pages 29-42
Back to the Future: Explicit Logic for Computer Science....Pages 43-43
Constraint Satisfaction with Countable Homogeneous Templates....Pages 44-57
Quantified Constraints: Algorithms and Complexity....Pages 58-70
Verification of Infinite State Systems....Pages 71-71
Parity of Imperfection or Fixing Independence....Pages 72-85
Atomic Cut Elimination for Classical Logic....Pages 86-97
Computational Mathematics, Computational Logic, and Symbolic Computation....Pages 98-99
Simple Stochastic Parity Games....Pages 100-113
Machine Characterizations of the Classes of the W-Hierarchy....Pages 114-127
Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions....Pages 128-141
On Relativisation and Complexity Gap for Resolution-Based Proof Systems....Pages 142-154
Strong Normalization of the Typed λ ws -Calculus....Pages 155-168
A Fixed-Point Logic with Symmetric Choice....Pages 169-182
Positive Games and Persistent Strategies....Pages 183-196
Generating All Abductive Explanations for Queries on Propositional Horn Theories....Pages 197-211
Refined Complexity Analysis of Cut Elimination....Pages 212-225
Comparing the Succinctness of Monadic Query Languages over Finite Trees....Pages 226-240
The Arithmetical Complexity of Dimension and Randomness....Pages 241-254
Towards a Proof System for Admissibility....Pages 255-270
Program Complexity of Dynamic LTL Model Checking....Pages 271-284
Coping Polynomially with Numerous but Identical Elements within Planning Problems....Pages 285-298
On Algebraic Specifications of Abstract Data Types....Pages 299-313
On the Complexity of Existential Pebble Games....Pages 314-329
Computational Aspects of Σ-Definability over the Real Numbers without the Equality Test....Pages 330-344
The Surprising Power of Restricted Programs and Gödel’s Functionals....Pages 345-358
Pebble Games on Trees....Pages 359-371
Bistability: An Extensional Characterization of Sequentiality....Pages 372-383
Automata on Lempel-Ziv Compressed Strings....Pages 384-396
Complexity of Some Problems in Modal and Intuitionistic Calculi....Pages 397-412
Goal-Directed Calculi for Gödel-Dummett Logics....Pages 413-426
A Logic for Probability in Quantum Systems....Pages 427-440
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory....Pages 441-454
The Epsilon Calculus....Pages 455-455
Modular Semantics and Logics of Classes....Pages 456-469
Validity of CTL Queries Revisited....Pages 470-483
Calculi of Meta-variables....Pages 484-497
Henkin Models of the Partial λ -Calculus....Pages 498-512
Nominal Unification....Pages 513-527
Friends or Foes? Communities in Software Verification....Pages 528-529
More Computation Power for a Denotational Semantics for First Order Logic....Pages 530-543
Effective Model Completeness of the Theory of Restricted Pfaffian Functions....Pages 544-544
Effective Quantifier Elimination over Real Closed Fields....Pages 545-545
Fast Infinite-State Model Checking in Integer-Based Systems....Pages 546-573
Winning Strategies and Synthesis of Controllers....Pages 574-574
Logical Relations for Dynamic Name Creation....Pages 575-588
Back Matter....Pages -