Computer science logic. 5th workshop, CSL '91, Berne, Switzerland, October 7--11, 1991. Proceedings (Q1202197)

The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 0782.00052]. Indexed articles: \textit{Bargury, Y.; Makowsky, J.}, The expressive power of transitive closure and 2-way multihead automata, 1-14 [Zbl 0783.03018] \textit{Beierle, Ch.; Börger, E.}, Correctness proof for the WAM with types, 15-34 [Zbl 0819.68028] \textit{Best, E.; Esparza, J.}, Model checking of persistent Petri nets, 35-52 [Zbl 0819.68083] \textit{Chirimar, J.; Lipton, J.}, Provability in TBLL: A decision procedure, 53-67 [Zbl 0783.03003] \textit{Dahlhaus, E.}, How to implement first order formulas in local memory machine models, 68-78 [Zbl 0819.68051] \textit{Feferman, S.}, A new approach to abstract data types. II: Computation on ADTs as ordinary computation, 79-95 [Zbl 0819.68078] \textit{Fernando, T.}, A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation, 96-110 [Zbl 0783.03031] \textit{Flum, J.}, On bounded theories, 111-118 [Zbl 0783.03020] \textit{Goerdt, A.}, The cutting plane proof system with bounded degree of falsity, 119-133 [Zbl 0819.68104] \textit{González-Moreno, J. C.; Hortalá-González, M. T.; Rodríguez-Artalejo, Mario}, Denotational versus declarative semantics for functional programming, 134-148 [Zbl 0819.68030] \textit{Grädel, E.}, On transitive closure logic, 149-163 [Zbl 0783.03012] \textit{Heusch, P.; Speckenmeyer, E.}, Some aspects of the probabilistic behavior of variants of resolution, 164-172 [Zbl 0819.68029] \textit{Hirshfeld, J.}, Safe queries in relational databases with functions, 173-183 [Zbl 0819.68047] \textit{Hooker, J. N.}, Logical inference and polyhedral projection, 184-200 [Zbl 0819.68105] \textit{Hösli, B.}, Stable logic, 201-212 [Zbl 0783.03009] \textit{Krishna Rao, M. R. K.; Kapur, D.; Shyamasundar, R. K.}, A transformational method for proving termination of logic programs, 213-226 [Zbl 0819.68032] \textit{Lehmann, D.}, Plausibility logic, 227-241 [Zbl 0819.68125] \textit{Leiß, H.}, Towards Kleene algebra with recursion, 242-256 [Zbl 0819.68073] \textit{Meinke, K.}, Equational specification of abstract types and combinators, 257-271 [Zbl 0783.03039] \textit{Mundici, D.}, Normal forms in infinite-valued logic: The case of one variable, 272-277 [Zbl 0783.03010] \textit{Oguztüzün, H.}, A fragment of first order logic adequate for observation equivalence, 278-292 [Zbl 0819.68127] \textit{Pinchinat, S.}, Ordinal processes in comparative concurrency semantics, 293-305 [Zbl 0783.03007] \textit{Renardel de Lavalette, G. R.}, Logical semantics of modularization, 306-315 [Zbl 0819.68079] \textit{Schmerl, U. R.}, A cut-elimination procedure designed for evaluating proofs as programs, 316-325 [Zbl 0783.03013] \textit{Schwichtenberg, H.}, Minimal from classical proofs, 326-328 [Zbl 0819.68031] \textit{Seibert, S.}, Quantifier hierarchies over word relations, 329-338 [Zbl 0783.03025] \textit{Steffen, E.}, Complexity results for the default- and the autoepistemic logic, 339-352 [Zbl 0819.68126] \textit{Stewart, I. A.}, On completeness for NP via projection translations, 353-366 [Zbl 0819.68066] \textit{Thistle, J. G.; Wonham, W. M.}, Control of \(\omega\)-automata, Church's problem, and the emptiness problem for tree \(\omega\)-automata, 367-381 [Zbl 0783.03019] \textit{Troelstra, A. S.}, Comparing the theory of representations and constructive mathematics, 382-395 [Zbl 0783.03032] \textit{Tyszkiewicz, J.}, Infinitary queries and their asymptotic probabilities. I: Properties definable in transitive closure logic, 396-409 [Zbl 0819.68080] \textit{Voronkov, A.}, On completeness of program synthesis systems, 411-418 [Zbl 0783.03027] \textit{Weiermann, A.}, Proving termination for term rewriting systems, 419-428 [Zbl 0819.68072]