000 | 05121nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-87531-4 | ||
003 | DE-He213 | ||
005 | 20240730182011.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540875314 _9978-3-540-87531-4 |
||
024 | 7 |
_a10.1007/978-3-540-87531-4 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aComputer Science Logic _h[electronic resource] : _b22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008, Proceedings / _cedited by Michael Kaminski, Simone Martini. |
250 | _a1st ed. 2008. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2008. |
|
300 |
_aXI, 513 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5213 |
|
505 | 0 | _aInvited 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 onthe 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. | |
520 | _aThis 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. | ||
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aMachine theory. _9126910 |
|
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 0 |
_aMathematical logic. _92258 |
|
650 | 1 | 4 |
_aTheory of Computation. _9126911 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9126912 |
650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aMathematical Logic and Foundations. _934712 |
700 | 1 |
_aKaminski, Michael. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9126913 |
|
700 | 1 |
_aMartini, Simone. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9126914 |
|
710 | 2 |
_aSpringerLink (Online service) _9126915 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540875307 |
776 | 0 | 8 |
_iPrinted edition: _z9783540875475 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v5213 _9126916 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-87531-4 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c91180 _d91180 |