000 | 04613nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-45459-5 | ||
003 | DE-He213 | ||
005 | 20240730192041.0 | ||
007 | cr nn 008mamaa | ||
008 | 100323s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540454595 _9978-3-540-45459-5 |
||
024 | 7 |
_a10.1007/11874683 _2doi |
|
050 | 4 | _aQA76.76.C65 | |
072 | 7 |
_aUMC _2bicssc |
|
072 | 7 |
_aCOM010000 _2bisacsh |
|
072 | 7 |
_aUMC _2thema |
|
082 | 0 | 4 |
_a005.45 _223 |
245 | 1 | 0 |
_aComputer Science Logic _h[electronic resource] : _b20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings / _cedited by Zoltán Ésik. |
250 | _a1st ed. 2006. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
300 |
_aXII, 627 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 ; _v4207 |
|
505 | 0 | _aInvited Presentations -- Functorial Boxes in String Diagrams -- Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract) -- Automata and Logics for Words and Trees over an Infinite Alphabet -- Nonmonotonic Logics and Their Algebraic Foundations -- Contributions -- Semi-continuous Sized Types and Termination -- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation -- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata -- The Power of Linear Functions -- Logical Omniscience Via Proof Complexity -- Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic -- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay -- Abstracting Allocation -- Collapsibility in Infinite-Domain Quantified Constraint Satisfaction -- Towards an Implicit Characterization of NC k -- On Rational Trees -- Reasoning About States of Probabilistic Sequential Programs -- Concurrent Games with Tail Objectives -- Nash Equilibrium for Upward-Closed Objectives -- Algorithms for Omega-Regular Games with Imperfect Information -- Relating Two Standard Notions of Secrecy -- Jump from Parallel to Sequential Proofs: Multiplicatives -- First-Order Queries over One Unary Function -- Infinite State Model-Checking of Propositional Dynamic Logics -- Weak Bisimulation Approximants -- Complete Problems for Higher Order Logics -- Solving Games Without Determinization -- Game Quantification on Automatic Structures and Hierarchical Model Checking Games -- An Algebraic Point of View on the Crane Beach Property -- A Sequent Calculus for Type Theory -- Universality Results for Models in Locally Boolean Domains -- Universal Structures and the Logic of Forbidden Patterns -- On the Expressive Power ofGraph Logic -- Hoare Logic in the Abstract -- Normalization of IZF with Replacement -- Acyclicity and Coherence in Multiplicative Exponential Linear Logic -- Church Synthesis Problem with Parameters -- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates -- Separation Logic for Higher-Order Store -- Satisfiability and Finite Model Property for the Alternating-Time ?-Calculus -- Space-Efficient Computation by Interaction -- The Ackermann Award 2006. | |
650 | 0 |
_aCompilers (Computer programs). _93350 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aMachine theory. _9148411 |
|
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 0 |
_aMathematical logic. _92258 |
|
650 | 1 | 4 |
_aCompilers and Interpreters. _931853 |
650 | 2 | 4 |
_aTheory of Computation. _9148412 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9148413 |
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 |
_aÉsik, Zoltán. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9148414 |
|
710 | 2 |
_aSpringerLink (Online service) _9148415 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540454588 |
776 | 0 | 8 |
_iPrinted edition: _z9783540830757 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4207 _9148416 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11874683 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c94049 _d94049 |