Computer Science Logic: 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $18.95
Usually ships in 1-2 business days
(Save 86%)
Other sellers (Paperback)
  • All (5) from $18.95   
  • New (4) from $18.95   
  • Used (1) from $168.85   


This book constitutes the refereed proceedings of the 22nd International Workshop on Computer Science Logic, CSL 2008, held as the 17th Annual Conference of the EACSL in Bertinoro, Italy, in September 2008.

The 31 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from 102 submissions. All current aspects of logic in computer science are addressed, ranging from foundational and methodological issues to application issues of practical relevance. The book concludes with a presentation of this year's Ackermann award.

Read More Show Less

Product Details

Table of Contents

Invited Talks.- The Computability Path Ordering: The End of a Quest.- The Joy of String Diagrams.- Model Transformations in Decidability Proofs for Monadic Theories.- Molecules as Automata.- Contributed Papers.- An Infinite Automaton Characterization of Double Exponential Time.- Recursion Schemata for NC k .- Extensional Uniformity for Boolean Circuits.- Pure Pointer Programs with Iteration.- Quantified Positive Temporal Constraints.- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars.- Continuous Fragment of the mu-Calculus.- On the Relations between the Syntactic Theories of—?-Calculi.- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms.- Proving Infinitude of Prime Numbers Using Binomial Coefficients.- A Tight Karp-Lipton Collapse Result in Bounded Arithmetic.- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract).- Quantitative Game Semantics for Linear Logic.- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic.- An Indexed System for Multiplicative Additive Polarized Linear Logic.- A Characterisation of Lambda Definability with Sums Via—??-Closure Operators.- Superposition for Fixed Domains.- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T.- On the Almighty Wand.- On Counting Generalized Colorings.- The Descriptive Complexity of Parity Games.- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games.- Quantitative Languages.- Characterization of Logics over Ranked Tree Languages.- The Nesting-Depth of Disjunctive—-Calculus for Tree Languages and the Limitedness Problem.- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract).- Syntactic Metatheory of Higher-Order Subtyping.- On Isomorphisms of Intersection Types.- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence.- Type-Based Termination with Sized Products.- The Ackermann Session.- The Ackermann Award 2008.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)