Sergeij Artemov / Anil Nerode (eds.)

Logical Foundations of Computer Science

International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings
Herausgegeben:Artemov, Sergei; Nerode, Anil

• Broschiertes Buch

Produktbeschreibung

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2007, held in New York, NY, USA in June 2007. The volume presents 36 revised refereed papers that address all current aspects of logic in computer science.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Theoretical Computer Science and General Issues 4514
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 12067930, 978-3-540-72732-3
• 2007
• Seitenzahl: 532
• Erscheinungstermin: 25. Mai 2007
• Englisch
• Abmessung: 235mm x 155mm x 29mm
• Gewicht: 739g
• ISBN-13: 9783540727323
• ISBN-10: 3540727329
• Artikelnr.: 22817937

Autorenporträt

Sergeij Artemov, GUNY Graduate Center, New York, NY, USA / Anil Nerode, Cornell Univesity, Ithaka, NY, USA

Inhaltsangabe

Justified 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.