Computer Science Logic 19th (34 results)

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments.Except for library markings, interior clean and unmarked. Tight binding.

Condition: New.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New. In English.

Condition: New.

Condition: New.

Condition: New. In English.

Condition: New. In English.

Condition: New. In English.

Condition: New. In English.

Condition: New. In English.

Condition: New.

Condition: New.

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Condition: New. In English.

Paperback. Condition: Brand New. 2nd edition. 349 pages. 9.25x6.25x0.75 inches. In Stock.

Condition: New.

Paperback. Condition: Brand New. 548 pages. 9.25x6.00x1.25 inches. In Stock.

Condition: New. In English.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Lectures.- XML Navigation and Tarski's Relation Algebras.- Verification in Predicate Logic with Time: Algorithmic Questions.- Note on Formal Analogical Reasoning in the Juridical Context.- An Abstract Strong Normalization Theorem.- Semantics and Logics.- On Bunched Polymorphism.- Distributed Control Flow with Classical Modal Logic.- A Logic of Coequations.- A Semantic Formulation of -Lifting and Logical Predicates for Computational Metalanguage.- Type Theory and Lambda Calculus.- Order Structures on Böhm-Like Models.- Higher-Order Matching and Games.- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations.- On the Role of Type Decorations in the Calculus of Inductive Constructions.- Linear Logic and Ludics.- L-Nets, Strategies and Proof-Nets.- Permutative Logic.- Focusing the Inverse Method for Linear Logic.- Towards a Typed Geometry of Interaction.- Constraints.- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints.- Finite Models, Decidability and Complexity.- Coprimality in Finite Models.- Towards a Characterization of Order-Invariant Queries over Tame Structures.- Decidability of Term Algebras Extending Partial Algebras.- Results on the Guarded Fragment with Equivalence or Transitive Relations.- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic.- On the Complexity of Hybrid Logics with Binders.- The Complexity of Independence-Friendly Fixpoint Logic.- Closure Properties of Weak Systems of Bounded Arithmetic.- Verification and Model Checking.- Transfinite Extension of the Mu-Calculus.- Bounded Model Checking of Pointer Programs.- PDLwith Intersection and Converse Is Decidable.- On Deciding Topological Classes of Deterministic Tree Languages.- Constructive Reasoning and Computational Mathematics.- Complexity and Intensionality in a Type-1 Framework for Computable Analysis.- Computing with Sequences, Weak Topologies and the Axiom of Choice.- Light Functional Interpretation.- Feasible Proofs of Matrix Properties with Csanky's Algorithm.- Implicit Computational Complexity and Rewriting.- A Propositional Proof System for Log Space.- Identifying Polynomial-Time Recursive Functions.- Confluence of Shallow Right-Linear Rewrite Systems.- Appendices.- The Ackermann Award 2005.- Clemens Lautemann: 1951-2005 An Obituary.…

Condition: New. In English.

Condition: New. 1st ed. 2023 edition NO-PA16APR2015-KAP.

Condition: New.

Taschenbuch. Condition: Neu. Neuware - The annual conference of the European Association for Computer Science Logic (EACSL), CSL 2010, was held in Brno (Czech Republic), August 23 27, 2010. The conference started as a series of international workshops on Computer S- ence Logic, and then at its sixth meeting became the Annual Conference of the EACSL. This conference was the 24th meeting and 19th EACSL conference; it was organized at the Faculty of Informatics, Masaryk University, Brno. In 2010, CSL and the 35th International Symposium on Mathematical Fo- dations of Computer Science (MFCS 2010)were federated and organizedin p- allel at the same place. The technical program and proceedings of MFCS 2010 andCSL2010werepreparedindependently. The federatedMFCSandCSL 2010 conference had ve common plenary sessions and common social events for all participants. The common plenary speakers were David Basin (Zur ich), Herbert Edelsbrunner(Klosterneuburg),ErichGrad el(Aachen),BojanMohar(Burnaby, Ljubljana), and Joseph Sifakis (Grenoble). Invited papers by David Basin and ErichGr adelwereincludedintheproceedingsofCSL.Inaddition,CSL2010had ve invited speakers, namely, Peter O Hearn (London), Jan Krajicek (Prague), Andrei Krokhin (Durham), Andrey Rybalchenko (Munich), and Viktor Kuncak (Lausanne).…

Condition: New. In English.

Condition: Sehr gut. Zustand: Sehr gut | Seiten: 548 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Condition: New. Print on Demand.