Computer science logic. 13th international workshop, CSL '99. 8th annual conference of the EACSL, Madrid, Spain, September 20--25, 1999. Proceedings (Q1819254)

The articles of mathematical interest will be reviewed individually. The preceding conference (12th, 1998) has been reviewed (see Zbl 0913.00028). Indexed articles: \textit{Balcázar, José L.}, The consistency dimension, compactness and query learning, 2-13 [Zbl 0942.68587] \textit{Grohe, Martin}, Descriptive and parameterized complexity, 14-31 [Zbl 0943.03029] \textit{Mosses, Peter D.}, Logical specification of operational semantics, 32-49 [Zbl 0969.68098] \textit{Delzanno, Giorgio; Esparza, Javier; Podelski, Andreas}, Constraint-based analysis of broadcast protocols, 50-66 [Zbl 0944.68139] \textit{Grädel, Erich; Kreutzer, Stephan}, Descriptive complexity theory for constraint databases, 67-81 [Zbl 0944.68053] \textit{Leivant, Daniel}, Applicative control and computational complexity, 82-95 [Zbl 0944.68070] \textit{Møller, Jesper; Lichtenberg, Jakob; Andersen, Henrik Reif; Hulgaard, Henrik}, Difference decision diagrams, 111-125 [Zbl 0944.68040] \textit{Fränzle, Martin}, Analysis of hybrid systems: An ounce of realism can save an infinity of states, 126-140 [Zbl 0944.68119] \textit{Kesten, Yonit; Pnueli, Amir}, Verifying liveness by augmented abstraction, 141-156 [Zbl 0944.68128] \textit{Rasmussen, Thomas Marthedal}, Signed interval logic, 157-171 [Zbl 0942.03027] \textit{Hirshfeld, Yoram; Rabinovich, Alexander}, Quantitative temporal logic, 172-187 [Zbl 0943.03017] \textit{Diekert, Volker; Gastin, Paul}, An expressively complete temporal logic without past tense operators for Mazurkiewicz traces, 188-203 [Zbl 0942.03028] \textit{Bonelli, Eduardo}, Using fields and explicit substitutions to implement objects and functions in a de Bruijn setting, 204-219 [Zbl 0942.03016] \textit{Fernández, Maribel; Mackie, Ian}, Closed reductions in the \(\lambda\)-calculus. (Extended abstract), 220-234 [Zbl 0944.03012] \textit{Ishtiaq, Samin; Pym, David J.}, Kripke resource models of a dependently-typed bunched \(\lambda\)-calculus. (Extended abstract), 235-249 [Zbl 0944.03014] \textit{Balat, Vincent; Di Cosmo, Roberto}, A linear logical view of linear type isomorphisms, 250-265 [Zbl 0943.03048] \textit{De Vos, Marina; Vermeir, Dirk}, Choice logic programs and Nash equilibria in strategic games, 266-276 [Zbl 0952.68030] \textit{Hagihara, Shigeki; Yonezaki, Naoki}, Resolution method for modal logic with well-founded frames, 277-291 [Zbl 0942.03026] \textit{Tobies, Stephan}, A NExpTime-complete description logic strictly contained in \(C^2\), 292-306 [Zbl 0944.03024] \textit{Areces, Carlos; Blackburn, Patrick; Marx, Maarten}, A raod-map on complexity for hybrid logics, 307-321 [Zbl 0942.03048] \textit{Lautemann, Clemens; Weinzinger, Bernhard}, MonadicNLIN and quantifier-free reductions, 322-337 [Zbl 0946.68054] \textit{Marcinkowski, Jerzy}, Directed reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé games, 338-349 [Zbl 0946.68056] \textit{Bradfield, J. C.}, Fixpoint alternation and the game quantifier, 350-361 [Zbl 0944.03028] \textit{Torán, Jacobo}, Lower bounds for space in resolution, 362-373 [Zbl 0942.03010] \textit{Stewart, Iain A.}, Program schemes, arrays, Lindström quantifiers and zero-one laws, 374-388 [Zbl 0942.03043] \textit{Beklemishev, L. D.}, Open least element principle and bounded query computation, 389-404 [Zbl 0942.03060] \textit{Ker, Andrew D.; Nickau, Hanno; Ong, C.-H. Luke}, A universal innocent game model for the Böhm tree lambda theory, 405-419 [Zbl 0944.03015] \textit{Compagnoni, Adriana; Goguen, Healfdene}, Anti-symmetry of higher-order subtyping, 420-438 [Zbl 0944.03020] \textit{Geuvers, Herman; Poll, Erik; Zwanenburg, Jan}, Safe proof checking in type theory with \(Y\), 439-452 [Zbl 0944.03008] \textit{Altenkirch, Thorsten; Reus, Bernhard}, Monadic presentations of lambda terms using generalized inductive types, 453-468 [Zbl 0944.03011] \textit{Roversi, Luca}, A P-Time completeness proof for light logics, 469-483 [Zbl 0942.03062] \textit{Seidl, Helmut; Neumann, Andreas}, On guarding nested fixpoints, 484-498 [Zbl 0944.03023] \textit{Kučera, Antonín; Esparza, Javier}, A logical viewpoint on process-algebraic quotients, 499-514 [Zbl 0944.68140] \textit{Gastin, Paul; Mislove, Michael}, A truly concurrent semantics for a simple parallel programming language, 515-529 [Zbl 0944.68123] \textit{Hannay, Jo Erskine}, Specification refinement with System F, 530-545 [Zbl 0944.68130] \textit{Honsell, Furio; Sannella, Donald}, Pre-logical relations, 546-561 [Zbl 0942.03018] \textit{Kinoshita, Yoshiki; Power, John}, Data refinement for call-by-value programming languages, 562-576 [Zbl 0944.68034]