LEADER 05844nam 22007695 450 001 996465895703316 005 20230222164124.0 010 $a3-540-92687-9 024 7 $a10.1007/978-3-540-92687-0 035 $a(CKB)1000000000714664 035 $a(SSID)ssj0000318717 035 $a(PQKBManifestationID)11224874 035 $a(PQKBTitleCode)TC0000318717 035 $a(PQKBWorkID)10311015 035 $a(PQKB)11465303 035 $a(DE-He213)978-3-540-92687-0 035 $a(MiAaPQ)EBC3063947 035 $a(PPN)132874628 035 $a(EXLCZ)991000000000714664 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogical Foundations of Computer Science$b[electronic resource] $eInternational Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings /$fedited by Sergei Artemov, Anil Nerode 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XI, 469 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5407 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-92686-0 320 $aIncludes bibliographical references and index. 327 $aApplications of Finite Duality to Locally Finite Varieties of BL-Algebras -- Completeness Results for Memory Logics -- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination -- Temporalization of Probabilistic Propositional Logic -- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings -- The Logic of Proofs as a Foundation for Certifying Mobile Computation -- ATL with Strategy Contexts and Bounded Memory -- A Relational Model of a Parallel and Non-deterministic ?-Calculus -- The NP-Completeness of Reflected Fragments of Justification Logics -- Taming Modal Impredicativity: Superlazy Reduction -- Positive Fork Graph Calculus -- Games on Strings with a Limited Order Relation -- Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees -- Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic -- A Clausal Approach to Proof Analysis in Second-Order Logic -- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics -- Light Linear Logic with Controlled Weakening -- Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm -- Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System -- Tableaux and Hypersequents for Justification Logic -- Topological Forcing Semantics with Settling -- Automata and Answer Set Programming -- A Labeled Natural Deduction System for a Fragment of CTL * -- Conservativity for Logics of Justified Belief -- Unifying Sets and Programs via Dependent Types -- Product-Free Lambek Calculus Is NP-Complete -- Games on Multi-stack Pushdown Systems -- Data Privacy for Knowledge Bases -- Fixed Point Theorems on Partial Randomness -- Decidability and Undecidability in Probability Logic -- A Bialgebraic Approach to Automata and Formal Language Theory. 330 $aThis book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2009, held in Deerfield Beach, Florida, USA in January 2008. The volume presents 31 revised refereed papers carefully selected by the program committee. All current aspects of logic in computer science are addressed, including constructive mathematics and type theory, logical foundations of programming, logical aspects of computational complexity, logic programming and constraints, automated deduction and interactive theorem proving, logical methods in protocol and program verification and in program specification and extraction, domain theory logics, logical foundations of database theory, equational logic and term rewriting, lambda and combinatory calculi, categorical logic and topological semantics, linear logic, epistemic and temporal logics, intelligent and multiple agent system logics, logics of proof and justification, nonmonotonic reasoning, logic in game theory and social software, logic of hybrid systems, distributed system logics, system design logics, as well as other logics in computer science. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5407 606 $aComputer science 606 $aAlgorithms 606 $aMathematical logic 606 $aMachine theory 606 $aComputer arithmetic and logic units 606 $aComputer science?Mathematics 606 $aComputer Science Logic and Foundations of Programming 606 $aAlgorithms 606 $aMathematical Logic and Foundations 606 $aFormal Languages and Automata Theory 606 $aArithmetic and Logic Structures 606 $aSymbolic and Algebraic Manipulation 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMathematical logic. 615 0$aMachine theory. 615 0$aComputer arithmetic and logic units. 615 0$aComputer science?Mathematics. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aAlgorithms. 615 24$aMathematical Logic and Foundations. 615 24$aFormal Languages and Automata Theory. 615 24$aArithmetic and Logic Structures. 615 24$aSymbolic and Algebraic Manipulation. 676 $a511.3 702 $aArtemov$b Sergei$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNerode$b Anil$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465895703316 996 $aLogical Foundations of Computer Science$9772536 997 $aUNISA