Vor Ort
Merkzettel Warenkorb
  • Produktbild: Logical Foundations of Computer Science
  • Produktbild: Logical Foundations of Computer Science

Logical Foundations of Computer Science International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

25.05.2007

Herausgeber

Sergei Artemov + weitere

Verlag

Springer Berlin

Seitenzahl

516

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

739 g

Auflage

2007

Sprache

Englisch

ISBN

978-3-540-72732-3

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

25.05.2007

Herausgeber

Verlag

Springer Berlin

Seitenzahl

516

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

739 g

Auflage

2007

Sprache

Englisch

ISBN

978-3-540-72732-3

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Logical Foundations of Computer Science
  • Produktbild: Logical Foundations of Computer Science
  • 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 Propositional Logic.- 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.