LEADER 06921nam 22007575 450 001 996465524203316 005 20200703184338.0 010 $a3-540-45793-3 024 7 $a10.1007/3-540-45793-3 035 $a(CKB)1000000000211859 035 $a(SSID)ssj0000322121 035 $a(PQKBManifestationID)11279117 035 $a(PQKBTitleCode)TC0000322121 035 $a(PQKBWorkID)10281193 035 $a(PQKB)10608918 035 $a(DE-He213)978-3-540-45793-0 035 $a(MiAaPQ)EBC3073014 035 $a(PPN)155196804 035 $a(EXLCZ)991000000000211859 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science Logic$b[electronic resource] $e16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September /$fedited by Julian Bradfield 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XII, 628 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2471 300 $aIncludes index. 311 $a3-540-44240-5 327 $aInvited Lectures -- Limit-Computable Mathematics and Its Applications -- Automata, Logic, and XML -- ?-Calculus via Games (Extended Abstract) -- Rewriting and Constructive Mathematics -- Bijections between Partitions by Two-Directional Rewriting Techniques -- On Continuous Normalization -- Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle -- Compactness and Continuity, Constructively Revisited -- Fixpoints and Recursion -- Hoare Logics for Recursive Procedures and Unbounded Nondeterminism -- A Fixpoint Theory for Non-monotonic Parallelism -- Greibach Normal Form in Algebraically Complete Semirings -- Linear and Resource Logics -- Proofnets and Context Semantics for the Additives -- A Tag-Frame System of Resource Management for Proof Search in Linear-Logic Programming -- Resource Tableaux -- Semantics -- Configuration Theories -- A Logic for Probabilities in Semantics -- Possible World Semantics for General Storage in Call-By-Value -- A Fully Abstract Relational Model of Syntactic Control of Interference -- Temporal Logics and Games -- Optimal Complexity Bounds for Positive LTL Games -- The Stuttering Principle Revisited: On the Expressiveness of Nested X and ? Operators in the Logic LTL -- Trading Probability for Fairness -- Probability, Games and Fixpoints -- A Logic of Probability with Decidable Model-Checking -- Solving Pushdown Games with a ?3 Winning Condition -- Partial Fixed-Point Logic on Infinite Structures -- On the Variable Hierarchy of the Modal ?-Calculus -- Complexity and Proof Complexity -- Implicit Computational Complexity for Higher Type Functionals -- On Generalizations of Semi-terms of Particularly Simple Form -- Local Problems, Planar Local Problems and Linear Time -- Equivalence and Isomorphism for Boolean Constraint Satisfaction -- Ludics and Linear Logic -- Travelling on Designs -- Designs, Disputes and Strategies -- Classical Linear Logic of Implications -- Lambda-Calculi -- Higher-Order Positive Set Constraints -- A Proof Theoretical Account of Continuation Passing Style -- Duality between Call-by-Name Recursion and Call-by-Value Iteration -- Decidability of Bounded Higher-Order Unification -- Open Proofs and Open Terms: A Basis for Interactive Logic -- Logical Relations for Monadic Types -- Resolution and Proofs -- On the Automatizability of Resolution and Related Propositional Proof Systems -- Extraction of Proofs from the Clausal Normal Form Transformation -- Resolution Refutations and Propositional Proofs with Height-Restrictions. 330 $aThe Annual Conference of the European Association for Computer Science Logic, CSL 2002, was held in the Old College of the University of Edinburgh on 22?25 September 2002. The conference series started as a programme of Int- national Workshops on Computer Science Logic, and then in its sixth meeting became the Annual Conference of the EACSL. This conference was the sixteenth meeting and eleventh EACSL conference; it was organized by the Laboratory for Foundations of Computer Science at the University of Edinburgh. The CSL 2002 Programme Committee considered 111 submissions from 28 countries during a two week electronic discussion; each paper was refereed by at least three reviewers. The Committee selected 37 papers for presentation at the conference and publication in these proceedings. The Programme Committee invited lectures from Susumu Hayashi, Frank Neven, and Damian Niwinski; ´ the papers provided by the invited speakers appear at the front of this volume. In addition to the main conference, two tutorials ? ?Introduction to Mu- Calculi? (Julian Brad?eld) and ?Parametrized Complexity? (Martin Grohe) ? were given on the previous day. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2471 517 3 $a22-25, 2002, Proceedings 606 $aComputers 606 $aProgramming languages (Electronic computers) 606 $aMathematical logic 606 $aArtificial intelligence 606 $aComputer logic 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 615 0$aComputers. 615 0$aProgramming languages (Electronic computers). 615 0$aMathematical logic. 615 0$aArtificial intelligence. 615 0$aComputer logic. 615 14$aTheory of Computation. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aMathematical Logic and Formal Languages. 615 24$aArtificial Intelligence. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Foundations. 676 $a005.1/01/5113 702 $aBradfield$b Julian$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aEuropean Association for Computer Science Logic.$bConference$d(11th :$f2002 :$eEdinburgh, Scotland) 712 12$aWorkshop on Computer Science Logic 906 $aBOOK 912 $a996465524203316 996 $aComputer Science Logic$9771972 997 $aUNISA