zbMATH — the first resource for mathematics

Computer science logic. 22nd international workshop, CSL 2008, 17th annual conference of the EACSL, Bertinoro, Italy, September 16–19, 2008. Proceedings. (English) Zbl 1148.68004
Lecture Notes in Computer Science 5213. Berlin: Springer (ISBN 978-3-540-87530-7/pbk). xi, 513 p. (2008).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The 21st workshop and the 16th conference have been reviewed (see Zbl 1122.68006).
Indexed articles:
Blanqui, Frédéric; Jouannaud, Jean-Pierre; Rubio, Albert, The computability path ordering: The end of a quest, 1-14 [Zbl 1156.68568]
Curien, Pierre-Louis, The joy of string diagrams, 15-22 [Zbl 1157.18301]
Thomas, Wolfgang, Model transformations in decidability proofs for monadic theories, 23-31 [Zbl 1157.03004]
La Torre, Salvatore; Madhusudan, P.; Parlato, Gennaro, An infinite automaton characterization of double exponential time, 33-48 [Zbl 1157.68040]
Bonfante, Guillaume; Kahle, Reinhard; Marion, Jean-Yves; Oitavem, Isabel, Recursion schemata for NC\(^{k }\), 49-63 [Zbl 1157.03019]
McKenzie, Pierre; Thomas, Michael; Vollmer, Heribert, Extensional uniformity for Boolean circuits, 64-78 [Zbl 1157.68030]
Hofmann, Martin; Schöpp, Ulrich, Pure pointer programs with iteration, 79-93 [Zbl 1156.68612]
Charatonik, Witold; Wrona, Michał, Quantified positive temporal constraints, 94-108 [Zbl 1156.68398]
Creignou, Nadia; Schnoor, Henning; Schnoor, Ilka, Non-uniform Boolean constraint satisfaction problems with cardinality constraint, 109-123 [Zbl 1156.68399]
Piskac, Ruzica; Kuncak, Viktor, Fractional collections with cardinality bounds, and mixed linear arithmetic with stars, 124-138 [Zbl 1156.68475]
Fontaine, Gaëlle, Continuous fragment of the mu-calculus, 139-153 [Zbl 1156.03325]
Saurin, Alexis, On the relations between the syntactic theories of \(\lambda \mu \)-calculi, 154-168 [Zbl 1156.03317]
Hermant, Olivier; Lipton, James, A constructive semantic approach to cut elimination in type theories with axioms, 169-183 [Zbl 1157.03031]
Nguyen, Phuong, Proving infinitude of prime numbers using binomial coefficients, 184-198 [Zbl 1157.03033]
Beyersdorff, Olaf; Müller, Sebastian, A tight Karp-Lipton collapse result in bounded arithmetic, 199-214 [Zbl 1157.03032]
Berardi, Stefano; de’Liguoro, Ugo, A calculus of realizers for EM\(_{1}\) arithmetic. (Extended abstract), 215-229 [Zbl 1156.03333]
Dal Lago, Ugo; Laurent, Olivier, Quantitative game semantics for linear logic, 230-245 [Zbl 1156.03332]
Tranquilli, Paolo, A characterization of hypercoherent semantic correctness in multiplicative additive linear logic, 246-261 [Zbl 1156.03322]
Hamano, Masahiro; Takemura, Ryo, An indexed system for multiplicative additive polarized linear logic, 262-277 [Zbl 1156.03334]
Katsumata, Shin-ya, A characterisation of lambda definability with sums via \(\top \top \)-closure operators, 278-292 [Zbl 1156.03315]
Horbach, Matthias; Weidenbach, Christoph, Superposition for fixed domains, 293-307 [Zbl 1156.03313]
Hodkinson, Ian; Montanari, Angelo; Sciavicco, Guido, Non-finite axiomatizability and undecidability of interval temporal logics with C, D, and T, 308-322 [Zbl 1156.03321]
Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne, On the almighty wand, 323-338 [Zbl 1157.03010]
Kotek, T.; Makowsky, J. A.; Zilber, B., On counting generalized colorings, 339-353 [Zbl 1157.05024]
Dawar, Anuj; Grädel, Erich, The descriptive complexity of parity games, 354-368 [Zbl 1157.68032]
Schewe, Sven, An optimal strategy improvement algorithm for solving parity and payoff games, 369-384 [Zbl 1156.68478]
Chatterjee, Krishnendu; Doyen, Laurent; Henzinger, Thomas A., Quantitative languages, 385-400 [Zbl 1156.68449]
Place, Thomas, Characterization of logics over ranked tree languages, 401-415 [Zbl 1156.03328]
Colcombet, Thomas; Löding, Christof, The nesting-depth of disjunctive \(\mu \)-calculus for tree languages and the limitedness problem, 416-430 [Zbl 1156.68451]
Eisinger, Jochen, Upper bounds on the automata size for integer and mixed real and integer linear arithmetic. (Extended abstract), 431-445 [Zbl 1156.03330]
Abel, Andreas; Rodriguez, Dulma, Syntactic metatheory of higher-order subtyping, 446-460 [Zbl 1156.03311]
Dezani-Ciancaglini, Mariangiola; Di Cosmo, Roberto; Giovannetti, Elio; Tatsuta, Makoto, On isomorphisms of intersection types, 461-477 [Zbl 1156.03314]
Nakazawa, Koji; Tatsuta, Makoto; Kameyama, Yukiyoshi; Nakano, Hiroshi, Undecidability of type-checking in domain-free typed lambda-calculi with existence, 478-492 [Zbl 1156.03316]
Barthe, Gilles; Grégoire, Benjamin; Riba, Colin, Type-based termination with sized products, 493-507 [Zbl 1156.68341]

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
03-06 Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations
03B70 Logic in computer science
00B25 Proceedings of conferences of miscellaneous specific interest
Full Text: DOI