Skip to main content
SpringerLink
Log in

Computer Science Logic

5th Workshop, CSL '91, Berne, Switzerland, October 7-11, 1991. Proceedings

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Egon Börger
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gerhard Jäger
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Hans Kleine Büning
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Michael M. Richter
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 626)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (33 papers)

  1. Front Matter

    Download chapter PDF

  2. The expressive power of transitive closure and 2-way multihead automata

    • Yaniv Bargury, Johann Makowsky
    Pages 1-14

  3. Correctness proof for the WAM with types

    • Christoph Beierle, Egon Börger
    Pages 15-34

  4. Model checking of persistent Petri nets

    • Eike Best, Javier Esparza
    Pages 35-52

  5. Provability in TBLL: A decision procedure

    • Jawahar Chirimar, James Lipton
    Pages 53-67

  6. How to implement first order formulas in local memory machine models

    • Elias Dahlhaus
    Pages 68-78

  7. A new approach to abstract data types II computation on ADTs as ordinary computation

    • Solomon Feferman
    Pages 79-95

  8. A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation

    • Tim Fernando
    Pages 96-110

  9. On bounded theories

    • Jörg Flum
    Pages 111-118

  10. The cutting plane proof system with bounded degree of falsity

    • Andreas Goerdt
    Pages 119-133

  11. Denotational versus declarative semantics for functional programming

    • Juan Carlos, González Moreno, Maria Teresa Hortalá González, Mario Rodríguez Artalejo
    Pages 134-148

  12. On transitive closure logic

    • Erich Grädel
    Pages 149-163

  13. Some aspects of the probabilistic behavior of variants of resolution

    • P. Heusch, E. Speckenmeyer
    Pages 164-172

  14. Safe queries in relational databases with functions

    • Joram Hirshfeld
    Pages 173-183

  15. Logical inference and polyhedral projection

    • J. N. Hooker
    Pages 184-200

  16. Stable logic

    • Brigitte Hösli
    Pages 201-212

  17. A transformational methodology for proving termination of logic programs

    • M. R. K. Krishna Rao, D. Kapur, R. K. Shyamasundar
    Pages 213-226

  18. Plausibility logic

    • Daniel Lehmann
    Pages 227-241

  19. Towards Kleene Algebra with recursion

    • Haas Leiß
    Pages 242-256

  20. Equational specification of abstract types and combinators

    • Karl Meinke
    Pages 257-271
Back to top

Keywords

About this book

This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 7-11, 1991. This was the fifth in a series of annual workshops on computer sciencelogic (the first four are recorded in LNCS volumes 329, 385, 440, and 533). The volume contains 33 invited and selected papers on a variety of logical topics in computer science, including abstract datatypes, bounded theories, complexity results, cut elimination, denotational semantics, infinitary queries, Kleene algebra with recursion, minimal proofs, normal forms in infinite-valued logic, ordinal processes, persistent Petri nets, plausibility logic, program synthesis systems, quantifier hierarchies, semantics of modularization, stable logic, term rewriting systems, termination of logic programs, transitive closure logic, variants of resolution, and many others.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation