Computer science logic. 15th international workshop, CSL 2001, 10th annual conference of the EACSL, Paris, France, September 10--13, 2001. Proceedings (Q5944309)

The articles of this volume will be reviewed individually. The preceding workshop (14th, 2000) has been reviewed (see Zbl 0944.00037). Indexed articles: \textit{O'Hearn, Peter; Reynolds, John; Yang, Hongseok}, Local reasoning about programs that alter data structures, 1-19 [Zbl 0999.68045] \textit{Van den Bussche, Jan}, Applications of Alfred Tarski's ideas in database theory, 20-37 [Zbl 0999.68055] \textit{Girard, Jean-Yves}, Locus solum: From the rules of logic to the logic of rules, 38 [Zbl 0999.68545] \textit{Kanovich, Max}, The expressive power of Horn monadic linear logic, 39-53 [Zbl 0999.03006] \textit{Guglielmi, Alessio; Straßburger, Lutz}, Non-commutativity and MELL in the calculus of structures, 54-68 [Zbl 0999.03054] \textit{Mogbil, Virgile}, Quadratic correctness criterion for non-commutative logic, 69-83 [Zbl 0999.03055] \textit{Chen, Yijia; Shen, Enshao}, Capture complexity by partition, 84-98 [Zbl 0999.68084] \textit{Grohe, Martin; Wöhrle, Stefan}, An existential locality theorem, 99-114 [Zbl 0999.03028] \textit{Marion, Jean-Yves}, Actual arithmetic and feasibility, 115-129 [Zbl 1005.68039] \textit{Schweikardt, Nicole}, The natural order-generic collapse for \(\omega\)-representable databases over the rational and the real ordered group, 130-144 [Zbl 1005.68057] \textit{Power, John; Tourlas, Konstantinos}, An algebraic foundation for higraphs, 145-159 [Zbl 0999.68044] \textit{Korovina, M. V.; Kudinov, O. V.}, Semantic characterisations of second-order computability over the real numbers, 160-172 [Zbl 0999.03041] \textit{Robinson, Edmund; Rosolini, Giuseppe}, An abstract look at realizability, 173-187 [Zbl 0999.03059] \textit{Danos, Vincent; Harmer, Russell}, The anatomy of innocence, 188-202 [Zbl 0999.68120] \textit{Bezem, Marc}, An improved extensionality criterion for higher-order logic programs, 203-216 [Zbl 0999.68035] \textit{Stärk, Robert F.; Nanchen, Stanislas}, A logic for abstract state machines, 217-231 [Zbl 0999.68122] \textit{van Eijck, Jan}, Constrained hyper tableaux, 232-246 [Zbl 0999.03007] \textit{Lutz, Carsten; Sattler, Ulrike; Wolter, Frank}, Modal logic and the two-variable fragment, 247-261 [Zbl 0999.03020] \textit{Koriche, Frédéric}, A logic for approximate first-order reasoning, 262-276 [Zbl 0999.68209] \textit{Dawar, A.; Grädel, E.; Kreutzer, S.}, Inflationary fixed points in modal logic, 277-291 [Zbl 0999.03019] \textit{Alechina, Natasha; Mendler, Michael; de Paiva, Valeria; Ritter, Eike}, Categorical and Kripke semantics for constructive S4 modal logic, 292-307 [Zbl 1005.03024] \textit{Rasmussen, Thomas Marthedal}, Labelled natural deduction for interval logics, 308-323 [Zbl 0999.03016] \textit{de Boer, Frank S.; van Eijk, Rogier M.}, Decidable navigation logics for object structures, 324-338 [Zbl 0999.03018] \textit{Charatonik, Witold; Talbot, Jean-Marc}, The decidability of model checking mobile ambients, 339-354 [Zbl 0999.68123] \textit{Galota, Matthias; Vollmer, Heribert}, A generalization of the Büchi-Elgot-Trakhtenbrot theorem, 355-368 [Zbl 0999.03033] \textit{Finkel, Olivier}, An effective extension of the Wagner hierarchy to blind counter automata, 369-383 [Zbl 0999.03034] \textit{Klaedtke, Felix}, Decision procedure for an extension of WS1S, 384-398 [Zbl 0999.03035] \textit{Akama, Yohji}, Limiting partial combinatory algebras towards infinitary lambda-calculi and classical logic, 399-413 [Zbl 0999.03013] \textit{Ronchi Della Rocca, Simona; Roversi, Luca}, Intersection logic, 414-428 [Zbl 0999.03011] \textit{Schröder, Lutz}, Life without the terminal type, 429-442 [Zbl 0999.03012] \textit{Abramsky, Samson; Lenisa, Marina}, Fully complete minimal PER models for the simply typed \(\lambda\)-calculus, 443-457 [Zbl 0999.03010] \textit{Martin, Keye}, A principle of induction, 458-468 [Zbl 0999.03025] \textit{Baaz, Matthias; Moser, Georg}, On a generalisation of Herbrand's theorem, 469-483 [Zbl 0999.03051] \textit{Goubault-Larrecq, Jean}, Well-founded recursive relations, 484-497 [Zbl 0999.68094] \textit{Schmidt-Schauß, Manfred}, Stratified context unification is in PSPACE, 498-512 [Zbl 0999.03008] \textit{Armando, Alessandro; Ranise, Silvio; Rusinowitch, Michaël}, Uniform derivation of decision procedures by superposition, 513-527 [Zbl 1005.03012] \textit{Roşu, Grigore}, Complete categorical equational deduction, 528-538 [Zbl 0999.03060] \textit{Ohsaki, Hitoshi}, Beyond regularity: Equational tree automata for associative and commutative theories, 539-553 [Zbl 1002.03032] \textit{Courtieu, Pierre}, Normalized types, 554-569 [Zbl 0999.03503] \textit{Kopylov, Alexei; Nogin, Aleksey}, Markov's principle for propositional type theory, 570-584 [Zbl 0999.03053] \textit{Schürmann, Carsten}, Recursion for higher-order encodings, 585-599 [Zbl 0999.03039] \textit{Matthes, Ralph}, Monotone inductive and coinductive constructors of rank 2, 600-614 [Zbl 0999.68037]