Computer science logic. 16th international workshop, CSL 2002, 11th annual conference of the EACSL, Edinburgh, Scotland, GB, September 22--25, 2002. Proceedings (Q1850309)

The articles of this volume will be reviewed individually. The preceding workshop (15th, 2001) has been reviewed (see Zbl 0971.00033). Indexed articles: \textit{Hayashi, Susumu; Akama, Yohji}, Limit-computable mathematics and its applications, 1 [Zbl 1020.03509] \textit{Neven, Frank}, Automata, logic, and XML, 2-26 [Zbl 1020.68044] \textit{Niwiński, Damian}, \(\mu\)-calculus via games (extended abstract), 27-43 [Zbl 1020.03510] \textit{Kanovich, Max}, Bijections between partitions by two-directional rewriting techniques, 44-58 [Zbl 1020.68042] \textit{Aehlig, Klaus; Joachimski, Felix}, On continuous normalization, 59-73 [Zbl 1020.03058] \textit{Chernov, Alexey V.; Skvortsov, Dmitriy P.; Skvortsova, Elena Z.; Vereshchagin, Nikolai K.}, Variants of realizability for propositional formulas and the logic of the weak law of excluded middle, 74-88 [Zbl 1020.03022] \textit{Bridges, Douglas; Ishihara, Hajime; Schuster, Peter}, Compactness and continuity, constructively revisited, 89-102 [Zbl 1021.03056] \textit{Nipkow, Tobias}, Hoare logics for recursive procedures and unbounded nondeterminism, 103-119 [Zbl 1020.03029] \textit{Chen, Yifeng}, A fixpoint theory for non-monotonic parallelism, 120-134 [Zbl 1020.68046] \textit{Ésik, Zoltán; Leiß, Hans}, Greibach normal form in algebraically complete semirings, 135-150 [Zbl 1020.68056] \textit{Mairson, Harry G.; Rival, Xavier}, Proofnets and context semantics for the additives, 151-166 [Zbl 1021.03055] \textit{Hodas, Joshua S.; López, Pablo; Polakow, Jeffrey; Stoilova, Lubomira; Pimentel, Ernesto}, A tag-frame system of resource management for proof search in linear-logic programming, 167-182 [Zbl 1020.68020] \textit{Galmiche, Didier; Méry, Daniel; Pym, David}, Resource tableaux (extended abstract), 183-199 [Zbl 1020.03508] \textit{Cenciarelli, Pietro}, Configuration theories, 200-215 [Zbl 1020.68059] \textit{Moshier, M. Andrew; Jung, Achim}, A logic for probabilities in semantics, 216-231 [Zbl 1020.68050] \textit{Levy, Paul Blain}, Possible world semantics for general storage in call-by-value, 232-246 [Zbl 1020.68047] \textit{McCusker, Guy}, A fully abstract relational model of syntactic control of interference, 247-261 [Zbl 1020.68048] \textit{Marcinkowski, Jerzy; Truderung, Tomasz}, Optimal complexity bounds for positive LTL games, 262-275 [Zbl 1020.03027] \textit{Kučera, Antonín; Strejček, Jan}, The stuttering principle revisited: On the expressiveness of nested \(X\) and \(U\) operators in the logic LTL, 276-291 [Zbl 1020.03026] \textit{Jurdzinski, Marcin; Kupferman, Orna; Henzinger, Thomas A.}, Trading probability for fairness, 292-305 [Zbl 1020.68060] \textit{Beauquier, Danièle; Rabinovich, Alexander; Slissenko, Anatol}, A logic of probability with decidable model-checking, 306-321 [Zbl 1021.03013] \textit{Cachat, Thierry; Duparc, Jacques; Thomas, Wolfgang}, Solving pushdown games with a \(\Sigma_3\) winning condition, 322-336 [Zbl 1020.68049] \textit{Kreutzer, Stephan}, Partial fixed-point logic on infinite structures, 337-351 [Zbl 1021.03017] \textit{Berwanger, Dietmar; Grädel, Erich; Lenzi, Giacomo}, On the variable hierarchy of the modal \(\mu\)-calculus, 352-366 [Zbl 1020.03025] \textit{Leivant, Daniel}, Implicit computational complexity for higher type functionals (extended abstract), 367-381 [Zbl 1020.03511] \textit{Baaz, Matthias; Moser, Georg}, On generalizations of semi-terms of particularly simple form, 382-396 [Zbl 1021.03051] \textit{Barbanchon, Régis; Grandjean, Etienne}, Local problems, planar local problems and linear time, 397-411 [Zbl 1020.68038] \textit{Böhler, Elmar; Hemaspaandra, Edith; Reith, Steffen; Vollmer, Heribert}, Equivalence and isomorphism for Boolean constraint satisfaction, 412-426 [Zbl 1020.68039] \textit{Faggian, Claudia}, Travelling on designs. Ludics dynamics, 427-441 [Zbl 1020.03059] \textit{Faggian, Claudia; Hyland, Martin}, Designs, disputes and strategies, 442-457 [Zbl 1020.03060] \textit{Hasegawa, Masahito}, Classical linear logic of implications, 458-472 [Zbl 1021.03054] \textit{Goubault-Larrecq, Jean}, Higher-order positive set constraints, 473-489 [Zbl 1020.03012] \textit{Ogata, Ichiro}, A proof theoretical account of continuation passing style, 490-505 [Zbl 1020.03030] \textit{Kakutani, Yoshihiko}, Duality between call-by-name recursion and call-by-value iteration, 506-521 [Zbl 1021.03016] \textit{Schmidt-Schauß, Manfred; Schulz, Klaus U.}, Decidability of bounded higher-order unification, 522-536 [Zbl 1021.03004] \textit{Geuvers, Herman; Jojgov, Gueorgui I.}, Open proofs and open terms: A basis for interactive logic, 537-552 [Zbl 1020.03010] \textit{Goubault-Larrecq, Jean; Lasota, Slawomir; Nowak, David}, Logical relations for monadic types, 553-568 [Zbl 1021.03003] \textit{Atserias, Albert; Bonet, María Luisa}, On the automatizability of resolution and related propositional proof systems, 569-583 [Zbl 1020.03008] \textit{de Nivelle, Hans}, Extraction of proofs from the clausal normal form transformation, 584-598 [Zbl 1020.03009] \textit{Beckmann, Arnold}, Resolution refutations and propositional proofs with height-restrictions, 599-612 [Zbl 1021.03052]