Logical Foundations of Computer Science [electronic resource] : International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings / edited by Sergei Artemov, Anil Nerode.
Contributor(s): Artemov, Sergei [editor.] | Nerode, Anil [editor.] | SpringerLink (Online service).
Material type: BookSeries: Theoretical Computer Science and General Issues: 4514Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007Edition: 1st ed. 2007.Description: XII, 516 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540727347.Subject(s): Computer science | Machine theory | Mathematical logic | Theory of Computation | Formal Languages and Automata Theory | Computer Science Logic and Foundations of Programming | Mathematical Logic and FoundationsAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access onlineJustified 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.
There are no comments for this item.