000 05503nam a22006255i 4500
001 978-3-540-92687-0
003 DE-He213
005 20240730193413.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783540926870
_9978-3-540-92687-0
024 7 _a10.1007/978-3-540-92687-0
_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 _aLogical Foundations of Computer Science
_h[electronic resource] :
_bInternational Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings /
_cedited by Sergei Artemov, Anil Nerode.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXI, 469 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 ;
_v5407
505 0 _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 BialgebraicApproach to Automata and Formal Language Theory.
520 _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.
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aMathematical logic.
_92258
650 0 _aMachine theory.
_9153506
650 0 _aComputer arithmetic and logic units.
_936750
650 0 _aComputer science
_xMathematics.
_93866
650 1 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aAlgorithms.
_93390
650 2 4 _aMathematical Logic and Foundations.
_934712
650 2 4 _aFormal Languages and Automata Theory.
_9153507
650 2 4 _aArithmetic and Logic Structures.
_936752
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
700 1 _aArtemov, Sergei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9153508
700 1 _aNerode, Anil.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9153509
710 2 _aSpringerLink (Online service)
_9153510
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540926863
776 0 8 _iPrinted edition:
_z9783540926887
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5407
_9153511
856 4 0 _uhttps://doi.org/10.1007/978-3-540-92687-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94735
_d94735