## 17th EACSL Annual Conference on## Computer Science Logic## 15th-19th September 2008,## Bertinoro, Italy |
---|

General Information Important Dates Call For Papers Submissions Program Committee Invited Speakers Program Venue Registration Travel Information Accepted Papers Ackermann Award Makowsky Symposium Pictures |
Andreas Abel and Dulma Rodriguez.A Syntactic Metatheory of Higher-Order Subtyping Matthias Horbach and Christoph Weidenbach.Superposition for Fixed Domains Salvatore La Torre, Parthasarathy Madhusudan and Gennaro Parlato.An Infinite Automaton Characterization of Double Exponential Time Tomer Kotek, Johann Makowsky and Boris Zilber.On counting functions of generalized colorings Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion and Isabel Oitavem.Recursion schemata for NC^k Krishnendu Chatterjee, Laurent Doyen and Thomas Henzinger.Quantitative Languages Mariangiola Dezani, Roberto Di Cosmo, Elio Giovannetti and Makoto
Tatsuta.On isomorphisms of intersection types Anuj Dawar and Erich GraedelThe Descriptive Complexity of Parity Games Pierre McKenzie, Michael Thomas and Heribert Vollmer.Extensional Uniformity for Boolean Circuits Ugo Dal Lago and Olivier Laurent.Quantitative Game Semantics for Linear Logic Thomas Place.Characterization of Logics Over Ranked Tree Languages Michal Wrona and Witold Charatoni.Quantified Weak Temporal Constraints Thomas Colcombet and Christof Loeding.The Nesting-Depth of Disjunctive $\mu$-calculus for Tree Languages and the Limitedness Problem Paolo Tranquilli.A characterization of MALL hypercoherent semantic correctness Martin Hofmann and Ulrich Schoepp.PURPLE: Pure Pointer Programs with Universal Iteration Phuong Nguyen.Proving Infinitude of Prime Numbers Using Binomial Coefficients Masahiro HAMANO and Ryo Takemura.An Indexed System for Multiplicative Additive Polarized Linear Logic Ian Hodkinson, Angelo Montanari and Guido Sciavicco.Non-Finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D and T Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama and Hiroshi Nakano.Undecidability of type-checking in domain-free typed lambda-calculi with existence Colin Riba, Gilles Barthe and Benjamin Gregoire.Towards practical and precise type-based termination Olaf Beyersdorff and Sebastian MuellerAn Optimal Karp-Lipton Collapse Result in Bounded Arithmetic Gaelle Fontaine.Continuous fragment of the mu-calculus Stefano Berardi and Ugo de'Liguoro.A Calculus of Realizers for EM_1 Arithmetic Remi Brochenin, Stephane Demri and Etienne Lozes.On the almighty wand Shin-ya Katsumata.A Characterisation of Lambda Definability with Sums via TT-Closure Operators Nadia Creignou, Henning Schnoor and Ilka Schnoor.Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint Ruzica Piskac and Viktor Kuncak.Fractional Collections with Cardinality Bounds Alexis Saurin.On the relations between the syntactic theories of lambda-mu-calculi Jochen Eisinger.Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic Olivier Hermant and James Lipton.A constructive semantic approach to cut elimination in type theories with axioms Sven Schewe.An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games |