Skip to main content
  • Conference proceedings
  • © 2004

Computer Science Logic

18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings

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

Conference series link(s): CSL: International Workshop on Computer Science Logic

Conference proceedings info: CSL 2004.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (38 papers)

  1. Front Matter

  2. Regular Papers

    1. On Nash Equilibria in Stochastic Games

      • Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdziński
      Pages 26-40
    2. A Bounding Quantifier

      • Mikołaj Bojańczyk
      Pages 41-55
    3. Integrating Equational Reasoning into Instantiation-Based Theorem Proving

      • Harald Ganzinger, Konstantin Korovin
      Pages 71-84
    4. Goal-Directed Methods for Łukasiewicz Logic

      • George Metcalfe, Nicola Olivetti, Dov Gabbay
      Pages 85-99
    5. A General Theorem on Termination of Rewriting

      • Jeremy E. Dawson, Rajeev Goré
      Pages 100-114
    6. On Proof Nets for Multiplicative Linear Logic with Units

      • Lutz Straßburger, François Lamarche
      Pages 145-159
    7. The Boundary Between Decidability and Undecidability for Transitive-Closure Logics

      • Neil Immerman, Alex Rabinovich, Tom Reps, Mooly Sagiv, Greta Yorsh
      Pages 160-174
    8. Game-Based Notions of Locality Over Finite Models

      • Marcelo Arenas, Pablo Barceló, Leonid Libkin
      Pages 175-189
    9. Fixed Points of Type Constructors and Primitive Recursion

      • Andreas Abel, Ralph Matthes
      Pages 190-204
    10. On the Building of Affine Retractions

      • Aleksy Schubert
      Pages 205-219
    11. Higher-Order Matching in the Linear λ-calculus with Pairing

      • Philippe de Groote, Sylvain Salvati
      Pages 220-234

Other Volumes

  1. Computer Science Logic

Keywords

  • 3-SAT
  • AI logics
  • Erfüllbarkeitsproblem der Aussagenlogik
  • calculus
  • classical logic
  • complexity
  • computer science logic
  • linear logic
  • logic
  • mathematical logic
  • model checking
  • proving
  • term rewriting
  • theorem proving
  • verification

Editors and Affiliations

  • Wroclaw University, Poland

    Jerzy Marcinkowski

  • Polish Academy of Sciences, Institute of Computer Science, Poland

    Andrzej Tarlecki

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions