Skip to main content
SpringerLink
Log in

Computer Science Logic

7th Workshop, CSL '93, Swansea, United Kingdom, September 13 - 17, 1993. Selected Papers

  • Conference proceedings
  • © 1994

Overview

Editors:
  1. Egon Börger
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Yuri Gurevich
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Karl Meinke
    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 832)

Included in the following conference series:

Conference proceedings info: CSL 1993.

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

  1. Front Matter

    Download chapter PDF

  2. The complexity of set constraints

    • Alexander Aiken, Dexter Kozen, Moshe Vardi, Ed Wimmers
    Pages 1-17

  3. On duality for the modal μ-calculus

    • Simon Ambler, Marta Kwiatkowska, Nicholas Measor
    Pages 18-32

  4. Short proofs of tautologies using the schema of equivalence

    • Matthias Baaz, Richard Zach
    Pages 33-35

  5. Process algebra with combinators

    • Jan A. Bergstra, Inge Bethke, Alban Ponse
    Pages 36-65

  6. Is game semantics necessary?

    • Andreas Blass
    Pages 66-77

  7. The model theory of concurrency

    • Kevin J. Compton, Rosario Uceda-Sosa
    Pages 78-90

  8. From semantics to rules: A machine assisted analysis

    • Catarina Coquand
    Pages 91-105

  9. On the reasons for average superlinear speedup in parallel backtrack search

    • Andreas Goerdt, Udo Kamps
    Pages 106-127

  10. Negation as inconsistency in PROLOG via intuitionistic logic

    • Alexey Gomolko
    Pages 128-138

  11. Approximable minimization problems and optimal solutions on random inputs

    • Erich Grädel, Anders Malmström
    Pages 139-149

  12. Bounded-arity hierarchies in fixed-point logics

    • Martin Grohe
    Pages 150-164

  13. Petri nets and the equivalence problem

    • Yoram Hirshfeld
    Pages 165-174

  14. Logical aspects of set constraints

    • Dexter Kozen
    Pages 175-188

  15. Oracles and quantifiers

    • J. A. Makowsky, Y. B. Pnueli
    Pages 189-222

  16. A Horn clause that implies an undecidable set of Horn clauses

    • Jerzy Marcinkowski
    Pages 223-237

  17. Higher-order action calculi

    • Robin Milner
    Pages 238-260

  18. A generic strong normalization argument: Application to the Calculus of Constructions

    • C. -H. L. Ong, E. Ritter
    Pages 261-279

  19. Data types, infinity and equality in system AF 2

    • Christophe Raffalli
    Pages 280-294

  20. Normalization for typed lambda calculi with explicit substitution

    • Eike Ritter
    Pages 295-304
Back to top

Other volumes

  1. Computer Science Logic

Keywords

About this book

This volume contains the final versions of a collection of papers presented at the Annual Conference of the European Association for Computer Science Logic, CSL '93, held at Swansea, UK in September 1993.
The 21 full papers included were selected from a total of 62 submissions and essentially contribute to the whole area of computer science logic research. They are devoted to such topics as set constraints, lambda calculi, process algebras, program semantics, intuitionistic logics, fixed-point logics, the equivalence problem, Horn clauses, quantifiers, and proof tranformations.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation