Computer science logic. 11th international workshop, CSL '97. Annual conference of the EACSL, Aarhus, Denmark, August 23--29, 1997. Proceedings (Q1389771)

The articles of this volume will be reviewed individually. The preceding workshop (10th, 1996) has been reviewed (see Zbl 0868.00033). Indexed articles: \textit{Abramsky, Samson; McCusker, Guy}, Call-by-value games, 1-17 [Zbl 0908.03035] \textit{Ayari, Abdelwaheb; Basin, David; Podelski, Andreas}, LISA: A specification language based on WS2S, 18-34 [Zbl 0908.03036] \textit{Backofen, Rolf; Clote, Peter}, Evolution as a computational engine, 35-55 [Zbl 0914.03046] \textit{Baillot, Patrick; Danos, Vincent; Ehrhard, Thomas; Regnier, Laurent}, Timeless games, 56-77 [Zbl 0908.03034] \textit{Barber, Andrew; Gardner, Philippa; Hasegawa, Masahito; Plotkin, Gordon}, From action calculi to linear logic, 78-97 [Zbl 0908.03031] \textit{Bonatti, P. A.; Olivetti, N.}, A sequent calculus for circumscription, 98-114 [Zbl 0909.03027] \textit{Bonet, Maria Luisa; Galesi, Nicola}, Linear lower bounds and simulations in Frege systems with substitutions, 115-128 [Zbl 0909.03047] \textit{Braüner, Torben; de Paiva, Valeria}, A formulation of linear logic based on dependency-relations, 129-148 [Zbl 0910.03034] \textit{Buss, Sam; Pitassi, Toniann}, Resolution and the weak pigeonhole principle, 149-156 [Zbl 0910.03036] \textit{Comon, Hubert; Jurski, Yan}, Higher-order matching and tree automata, 157-176 [Zbl 0911.03006] \textit{Coquand, Thierry; Persson, Henrik}, A proof-theoretical investigation of Zantema's problem, 177-188 [Zbl 0910.03033] \textit{Durand, Arnaud; Fagin, Ronald; Loescher, Bernd}, Spectra with only unary function symbols, 189-202 [Zbl 0913.03041] \textit{Faggian, Claudia}, Classical proofs via basic logic, 203-219 [Zbl 0910.03035] \textit{Grohe, Martin}, Canonization for \(L^k\)-equivalence is hard, 220-238 [Zbl 0913.03042] \textit{Hartonas, Chrysafis; Hennessy, Matthew}, Full abstractness for a functional/concurrent language with higher-order value-passing. (Extended abstract), 239-254 [Zbl 0910.03012] \textit{Heckmann, Reinhold; Huth, Michael}, A duality theory for quantitative semantics, 255-274 [Zbl 0908.06004] \textit{Hofmann, Martin}, A mixed modal/linear lambda calculus with applications to Bellantoni-Cook safe recursion, 275-294 [Zbl 0908.03022] \textit{Hollenberg, Marco}, Equational axioms of test algebra, 295-310 [Zbl 0909.03029] \textit{Klarlund, Nils}, Mona \(\&\) Fido: The logic-automaton connection in practice, 311-326 [Zbl 0916.68099] \textit{Kupferman, Orna; Kurshan, Robert P.; Yannakakis, Mihalis}, Existence of reduction hierarchies, 327-340 [Zbl 0909.68119] \textit{Moschovakis, Yiannis N.}, A game-theoretic, concurrent and fair model of the typed \(\lambda\)-calculus, with full recursion, 341-359 [Zbl 0914.03020] \textit{Olive, Frédéric}, A conjunctive logical characterization of nondeterministic linear time, 360-372 [Zbl 0914.03049] \textit{Pezzoli, Elena}, On the computational complexity of type 2 functionals, 373-388 [Zbl 0910.03027] \textit{Power, John}, Categories with algebraic structure, 389-405 [Zbl 0913.18006] \textit{Ruet, Paul; Fages, François}, Concurrent constraint programming and non-commutative logic, 406-423 [Zbl 0908.03033] \textit{Schiering, Ina}, A hierarchical approach to monadic second-order logic over graphs, 424-440 [Zbl 0914.03006] \textit{Schweikardt, Nicole}, The monadic quantifier alternation hierarchy over grids and pictures, 441-460 [Zbl 0909.03009] \textit{Schwentick, Thomas}, Padding and the expressive power of existential second-order logics, 461-477 [Zbl 0909.03010] \textit{Staiger, Ludwig}, Rich \(\omega\)-words and monadic second-order arithmetic, 478-490 [Zbl 0914.03058] \textit{Voda, Paul J.}, A simple ordinal recursive normalization of Gödel's \(T\), 491-509 [Zbl 0961.03054]