000 04347nam a22005535i 4500
001 978-3-540-72734-7
003 DE-He213
005 20240730192846.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540727347
_9978-3-540-72734-7
024 7 _a10.1007/978-3-540-72734-7
_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 2007, New York, NY, USA, June 4-7, 2007, Proceedings /
_cedited by Sergei Artemov, Anil Nerode.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXII, 516 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 ;
_v4514
505 0 _aJustified and Common Knowledge: Limited Conservativity -- The Intensional Lambda Calculus -- Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers -- Elementary Differential Calculus on Discrete and Hybrid Structures -- Weighted Distributed Systems and Their Logics -- Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! -- On Decidability and Expressiveness of Propositional Interval Neighborhood Logics -- Reasoning About Sequences of Memory States -- Cut Elimination in Deduction Modulo by Abstract Completion -- Density Elimination and Rational Completeness for First-Order Logics -- Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus -- Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics -- A Decidable Temporal Logic of Repeating Values -- Model Checking Knowledge and Linear Time: PSPACE Cases -- Realizations and LP -- Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking -- Explicit Proofs in Formal Provability Logic -- A Synthesis Algorithm for Hybrid Systems -- Including the Past in 'Topologic' -- A Note on Rewriting Proofs and Fibonacci Numbers -- On Complexity of Ehrenfeucht-Fraïssé Games -- The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion -- Hypersequent Calculus for Intuitionistic Logic with Classical Atoms -- Proof Identity for Classical Logic: Generalizing to Normality -- On the Constructive Dedekind Reals: Extended Abstract -- Verifying Balanced Trees -- Compactness Properties for Stable Semantics of Logic Programs -- Uniform Circuits, & Boolean Proof Nets -- Finite Automata Presentable Abelian Groups -- Embeddings into Free Heyting Algebras and Translations into Intuitionistic PropositionalLogic -- Some Puzzles About Probability and Probabilistic Conditionals -- A Temporal Dynamic Logic for Verifying Hybrid System Invariants -- Multiplexor Categories and Models of Soft Linear Logic -- Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms -- Total Public Announcements.
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9151535
650 0 _aMathematical logic.
_92258
650 1 4 _aTheory of Computation.
_9151536
650 2 4 _aFormal Languages and Automata Theory.
_9151537
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aMathematical Logic and Foundations.
_934712
700 1 _aArtemov, Sergei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151538
700 1 _aNerode, Anil.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151539
710 2 _aSpringerLink (Online service)
_9151540
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540727323
776 0 8 _iPrinted edition:
_z9783540838791
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4514
_9151541
856 4 0 _uhttps://doi.org/10.1007/978-3-540-72734-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94470
_d94470