Merkzettel Warenkorb
Produktbild: Computer Science Logic
Band 5213 - 20%

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

Aus der Reihe Theoretical Computer Science and General Issues
20% sparen

84,99 € UVP 106,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Lieferung nach Hause

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

10.09.2008

Herausgeber

Michael Kaminski + weitere

Verlag

Springer Berlin

Seitenzahl

513

Maße (L/B/H)

24,4/15,9/3,2 cm

Auflage

2008

Sprache

Englisch

ISBN

978-3-540-87530-7

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

10.09.2008

Herausgeber

Verlag

Springer Berlin

Seitenzahl

513

Maße (L/B/H)

24,4/15,9/3,2 cm

Auflage

2008

Sprache

Englisch

ISBN

978-3-540-87530-7

Herstelleradresse

Springer Nature Customer Service Center GmbH
Europaplatz 3
69115 Heidelberg
DE
ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Computer Science Logic
  • 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.