Cantitate/Preț
Produs

Computer Science Logic: 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008, Proceedings (Lecture Notes in Computer Science, nr. 5213)

Editat de Michael Kaminski, Simone Martini
Notă GoodReads:
en Limba Engleză Paperback – 10 Sep 2008
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 79860 lei

Preț vechi: 99825 lei
-20%

Puncte Express: 1198

Preț estimativ în valută:
15438 16168$ 13376£

Carte disponibilă

Livrare economică 21 decembrie 22 - 04 ianuarie 23
Livrare express 10-20 decembrie pentru 8544 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540875307
ISBN-10: 3540875301
Pagini: 531
Ilustrații: XI, 513 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.77 kg
Ediția: 2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science , Theoretical Computer Science and General Issues

Locul publicării: Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.