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 (Q1407206)

The articles of this volume will be reviewed individually. The preceding workshop and conference have been reviewed (see Zbl 1001.00046). Indexed articles: \textit{Abdulla, Parosh Aziz; Bouajjani, Ahmed; d'Orso, Julien}, Deciding monotonic games, 1-14 [Zbl 1116.68491] \textit{Aichernig, Bernhard K.}, The commuting V-diagram. On the relation of refinement and testing., 15-28 [Zbl 1116.68392] \textit{Andreoli, Jean-Marc; Mazaré, Laurent}, Concurrent construction of proof-nets, 29-42 [Zbl 1116.03311] \textit{Artemov, Sergei}, Back to the future: explicit logic for computer science (abstract), 43 [Zbl 1116.03312] \textit{Bodirsky, Manuel; Nešetřil, Jaroslav}, Constraint satisfaction with countable homogeneous templates, 44-57 [Zbl 1116.03313] \textit{Börner, Ferdinand; Bulatov, Andrei; Jeavons, Peter; Krokhin, Andrei}, Quantified constraints: Algorithms and complexity, 58-70 [Zbl 1116.03314] \textit{Bouajjani, Ahmed}, Verification of infinite state systems (abstract), 71 [Zbl 1116.68492] \textit{Bradfield, Julian C.}, Parity of imperfection or fixing independence, 72-85 [Zbl 1116.03310] \textit{Brünnler, Kai}, Atomic cut elimination for classical logic, 86-97 [Zbl 1116.03335] \textit{Buchberger, Bruno}, Computational mathematics, computational logic, and symbolic computation, 98-99 [Zbl 1116.03315] \textit{Chatterjee, Krishnendu; Jurdziński, Marcin; Henzinger, Thomas A.}, Simple stochastic parity games, 100-113 [Zbl 1116.68493] \textit{Chen, Yijia; Flum, Jörg}, Machine characterizations of the classes of the W-hierarchy, 114-127 [Zbl 1116.68470] \textit{Chevalier, Yannick; Küsters, Ralf; Rusinowitch, Michaël; Turuani, Mathieu; Vigneron, Laurent}, Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions, 128-141 [Zbl 1116.94314] \textit{Dantchev, Stefan; Riis, Søren}, On relativisation and complexity gap for resolution-based proof systems, 142-154 [Zbl 1116.03336] \textit{David, René; Guillaume, Bruno}, Strong normalization of the typed \(\lambda_{ws}\)-calculus, 155-168 [Zbl 1116.03305] \textit{Dawar, Anuj; Richerby, David}, A fixed-point logic with symmetric choice, 169-182 [Zbl 1116.03316] \textit{Duparc, Jacques}, Positive games and persistent strategies, 183-196 [Zbl 1116.03317] \textit{Eiter, Thomas; Makino, Kazuhisa}, Generating all abductive explanations for queries on propositional Horn theories, 197-211 [Zbl 1116.68591] \textit{Gerhardy, Philipp}, Refined complexity analysis of cut elimination, 212-225 [Zbl 1116.03318] \textit{Grohe, Martin; Schweikardt, Nicole}, Comparing the succinctness of monadic query languages over finite trees, 226-240 [Zbl 1116.03327] \textit{Hitchcock, John M.; Lutz, Jack H.; Terwijn, Sebastiaan A.}, The arithmetical complexity of dimension and randomness, 241-254 [Zbl 1116.03330] \textit{Iemhoff, Rosalie}, Towards a proof system for admissibility, 255-270 [Zbl 1116.03304] \textit{Kähler, Detlef; Wilke, Thomas}, Program complexity of dynamic LTL model checking, 271-284 [Zbl 1116.68494] \textit{Kanovich, Max; Vauzeilles, Jacqueline}, Coping polynomially with numerous but identical elements within planning problems, 285-298 [Zbl 1116.68593] \textit{Khoussainov, Bakhadyr}, On algebraic specifications of abstract data types, 299-313 [Zbl 1116.68498] \textit{Kolaitis, Phokion G.; Panttaja, Jonathan}, On the complexity of existential pebble games, 314-329 [Zbl 1116.68474] \textit{Korovina, Margarita}, Computational aspects of \(\Sigma\)-definability over the real numbers without the equality test, 330-344 [Zbl 1116.03329] \textit{Kristiansen, Lars; Voda, Paul J.}, The surprising power of restricted programs and Gödel's functionals, 345-358 [Zbl 1116.68395] \textit{Krzeszczakowski, Łukasz}, Pebble games on trees, 359-371 [Zbl 1116.68475] \textit{Laird, James}, Bistability: An extensional characterization of sequentiality, 372-383 [Zbl 1116.68380] \textit{Leiß, Hans; de Rougemont, Michel}, Automata on Lempel-Ziv compressed strings, 384-396 [Zbl 1116.68495] \textit{Maksimova, Larisa; Voronkov, Andrei}, Complexity of some problems in modal and intuitionistic calculi, 397-412 [Zbl 1116.03328] \textit{Metcalfe, George; Olivetti, Nicola; Gabbay, Dov}, Goal-directed calculi for Gödel-Dummett logics, 413-426 [Zbl 1116.03309] \textit{van der Meyden, Ron; Patra, Manas}, A logic for probability in quantum systems, 427-440 [Zbl 1116.03324] \textit{Miquel, Alexandre}, A strongly normalising Curry-Howard correspondence for IZF set theory, 441-454 [Zbl 1116.03332] \textit{Moser, Georg; Zach, Richard}, The epsilon calculus (abstract), 455 [Zbl 1116.03302] \textit{Reus, Bernhard}, Modular semantics and logics of classes, 456-469 [Zbl 1116.03319] \textit{Samer, Marko; Veith, Helmut}, Validity of CTL queries revisited, 470-483 [Zbl 1116.03320] \textit{Sato, Masahiko; Sakurai, Takafumi; Kameyama, Yukiyoshi; Igarashi, Atsushi}, Calculi of meta-variables, 484-497 [Zbl 1116.03321] \textit{Schröder, Lutz}, Henkin models of the partial \(\lambda\)-calculus, 498-512 [Zbl 1116.03307] \textit{Urban, Christian; Pitts, Andrew; Gabbay, Murdoch}, Nominal unification, 513-527 [Zbl 1116.03322] \textit{Veith, Helmut}, Friends or foes? Communities in software verification, 528-529 [Zbl 1116.68497] \textit{Vermeulen, Kess F. M.}, More computation power for a denotational semantics for first order logic, 530-543 [Zbl 1116.03323] \textit{Vorobjov, Nicolai}, Effective model completeness of the theory of restricted Pfaffian functions (abstract), 544 [Zbl 1116.03325] \textit{Vorobjov, Nicolai}, Effective quantifier elimination over real closed fields (abstract), 545 [Zbl 1116.03326] \textit{Rybina, Tatiana; Voronkov, Andrei}, Fast infinite-state model checking in integer-based systems, 546-573 [Zbl 1116.68496] \textit{Walukiewicz, Igor}, Winning strategies and synthesis of controllers (abstract), 574 [Zbl 1116.68542] \textit{Zhang, Yu; Nowak, David}, Logical relations for dynamic name creation, 575-588 [Zbl 1116.03308]