Skip to main content
SpringerLink
Log in

Computer Science Logic

15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Laurent Fribourg

    1. LSV (Ecole Normale Supérieure de Cachan and CNRS), Cachan, France

    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 2142)

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

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (42 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Invited Papers

    1. Local Reasoning about Programs that Alter Data Structures

      • Peter O’Hearn, John Reynolds, Hongseok Yang
      Pages 1-19

    2. Applications of Alfred Tarski’s Ideas in Database Theory

      • Jan Van den Bussche
      Pages 20-37

    3. Locus Solum: From the Rules of Logic to the Logic of Rules

      • Jean-Yves Girard
      Pages 38-38

  3. Contributed Papers

    1. The Expressive Power of Horn Monadic Linear Logic

      • Max Kanovich
      Pages 39-53

    2. Non-commutativity and MELL in the Calculus of Structures

      • Alessio Guglielmi, Lutz StraĂźburger
      Pages 54-68

    3. Quadratic Correctness Criterion for Non-commutative Logic

      • Virgile Mogbil
      Pages 69-83

  4. Descriptive Complexity

    1. Capture Complexity by Partition

      • Yijia Chen, Enshao Shen
      Pages 84-98

    2. An Existential Locality Theorem

      • Martin Grohe, Stefan Wöhrle
      Pages 99-114

    3. Actual Arithmetic and Feasibility

      • Jean-Yves Marion
      Pages 115-129

    4. The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group

      • Nicole Schweikardt
      Pages 130-144

  5. Semantics

    1. An Algebraic Foundation for Higraphs

      • John Power, Konstantinos Tourlas
      Pages 145-159

    2. Semantic Characterisations of Second-Order Computability over the Real Numbers

      • M. V. Korovina, O. V. Kudinov
      Pages 160-172

    3. An Abstract Look at Realizability

      • Edmund Robinson, Giuseppe Rosolini
      Pages 173-187

    4. The Anatomy of Innocence

      • Vincent Danos, Russell Harmer
      Pages 188-202

  6. Higher-Order Programs

    1. An Improved Extensionality Criterion for Higher-Order Logic Programs

      • Marc Bezem
      Pages 203-216

    2. A Logic for Abstract State Machines

      • Robert F. Stärk, Stanislas Nanchen
      Pages 217-231

    3. Constrained Hyper Tableaux

      • Jan van Eijck
      Pages 232-246

  7. Modal Logics

    1. Modal Logic and the Two-Variable Fragment

      • Carsten Lutz, Ulrike Sattler, Frank Wolter
      Pages 247-261

    2. A Logic for Approximate First-Order Reasoning

      • FrĂ©dĂ©ric Koriche
      Pages 262-276
Back to top

Keywords

Editors and Affiliations

  • LSV (Ecole Normale SupĂ©rieure de Cachan and CNRS), Cachan, France

    Laurent Fribourg

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation