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

Logical Foundations of Computer Science International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

18.12.2008

Herausgeber

Sergei Artemov + weitere

Verlag

Springer Berlin

Seitenzahl

469

Maße (L/B/H)

23,5/15,5/2,7 cm

Gewicht

736 g

Auflage

2009

Sprache

Englisch

ISBN

978-3-540-92686-3

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

18.12.2008

Herausgeber

Verlag

Springer Berlin

Seitenzahl

469

Maße (L/B/H)

23,5/15,5/2,7 cm

Gewicht

736 g

Auflage

2009

Sprache

Englisch

ISBN

978-3-540-92686-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
  • Applications 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 Bialgebraic Approach to Automata and Formal Language Theory.