Skip to main content
SpringerLink
Log in

Computer Science Logic

9th International Workshop, CSl '95, Annual Conference of the EACSL Paderborn, Germany, September 22-29, 1995. Selected Papers

  • Conference proceedings
  • © 1996

Overview

Editors:
  1. Hans Kleine Büning
    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 1092)

Included in the following conference series:

Conference proceedings info: CSL 1995.

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 (27 papers)

  1. Front Matter

    Download chapter PDF

  2. Incompleteness of a first-order gödel logic and some temporal logics of programs

    • Matthias Baaz, Alexander Leitsch, Richard Zach
    Pages 1-15

  3. Semantics of non-terminating rewrite systems using minimal coverings

    • José Barros, Joseph Goguen
    Pages 16-35

  4. Congruence Types

    • Gilles Barthe, Herman Geuvers
    Pages 36-51

  5. Deduction by combining semantic tableaux and integer programming

    • Bernhard Beckert, Reiner Hähnle
    Pages 52-63

  6. leanEA: A lean evolving algebra compiler

    • Bernhard Beckert, Joachim Posegga
    Pages 64-85

  7. A proof system for finite trees

    • Patrick Blackburn, Wilfried Meyer-Viol, Maarten de Rijke
    Pages 86-105

  8. Representing unification in a logical framework

    • Jason Brown, Lincoln A. Wallen
    Pages 106-129

  9. Decision procedures using model building techniques

    • Ricardo Caferra, Nicolas Peltier
    Pages 130-144

  10. A note on the relation between polynomial time functionals and Constable's class K

    • P. Clote
    Pages 145-160

  11. First order logic, fixed point logic and linear order

    • Anuj Dawar, Steven Lindell, Scott Weinstein
    Pages 161-177

  12. Simultaneous rigid E-unification is undecidable

    • Anatoli Degtyarev, Andrei Voronkov
    Pages 178-190

  13. An evolving algebra abstract machine

    • Giuseppe Del Castillo, Igor Đurđanović, Uwe Glässer
    Pages 191-214

  14. Rewriting with extensional polymorphic λ-calculus

    • Roberto Di Cosmo, Delia Kesner
    Pages 215-232

  15. Languages and logical definability in concurrency monoids

    • Manfred Droste, Dietrich Kuske
    Pages 233-251

  16. Generalized implicit definitions on finite structures

    • Stéphane Grumbach, Zoé Lacroix, Steven Lindell
    Pages 252-265

  17. The railroad crossing problem: An experiment with instantaneous actions and immediate reactions

    • Yuri Gurevich, James K. Huggins
    Pages 266-290

  18. A logical aspect of parametric polymorphism

    • Ryu Hasegawa
    Pages 291-307

  19. On the modal logic K plus theories

    • Alain Heuerding, Stefan Schwendimann
    Pages 308-319

  20. Improved decision procedures for the modal logics K, T and S4

    • Jörg Hudelmaier
    Pages 320-334
Back to top

Other volumes

  1. Computer Science Logic

Keywords

About this book

This book contains a carefully refereed selection of papers presented at the 1995 Annual Conference of the European Association for Computer Science Logic, CSL '95, held in Paderborn, Germany, in September 1995.
The 27 revised full papers included were selected after two rounds of reviewing from a total of 74 submissions for presentation at the conference and present the state-of-the-art in the area. Among the topics addressed are temporal logics, rewriting systems, deduction, theorem proving, process algebra, linear logics, proof theory, formal languages, and others.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation