LEADER 05087nam 22007455 450 001 996465977603316 005 20230406044128.0 010 $a3-540-45459-4 024 7 $a10.1007/11874683 035 $a(CKB)1000000000283780 035 $a(SSID)ssj0000316900 035 $a(PQKBManifestationID)11258553 035 $a(PQKBTitleCode)TC0000316900 035 $a(PQKBWorkID)10286687 035 $a(PQKB)10404554 035 $a(DE-He213)978-3-540-45459-5 035 $a(MiAaPQ)EBC3068167 035 $a(PPN)123138604 035 $a(EXLCZ)991000000000283780 100 $a20100323d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic$b[electronic resource] $e20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings /$fedited by Zoltán Ésik 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XII, 627 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4207 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-45458-6 320 $aIncludes bibliographical references and index. 327 $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 of Graph 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4207 606 $aCompilers (Computer programs) 606 $aComputer science 606 $aMachine theory 606 $aArtificial intelligence 606 $aMathematical logic 606 $aCompilers and Interpreters 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aArtificial Intelligence 606 $aComputer Science Logic and Foundations of Programming 606 $aMathematical Logic and Foundations 615 0$aCompilers (Computer programs). 615 0$aComputer science. 615 0$aMachine theory. 615 0$aArtificial intelligence. 615 0$aMathematical logic. 615 14$aCompilers and Interpreters. 615 24$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aArtificial Intelligence. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aMathematical Logic and Foundations. 676 $a005.1/015113 702 $aÉsik$b Zoltán$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aEuropean Association for Computer Science Logic.$bConference$d(15th :$eSzeged, Hungary) 712 12$aWorkshop on Computer Science Logic 906 $aBOOK 912 $a996465977603316 996 $aComputer Science Logic$9771972 997 $aUNISA