- 5 Ergebnisse
Kleinster Preis: € 53,49, größter Preis: € 129,00, Mittelwert: € 88,20
1
Bestellen
bei ebooks.com
€ 129,00
Bestellengesponserter Link
>100:

Computer Science Logic - neues Buch

2005, ISBN: 9783540318972

TheAnnualConferenceoftheEuropeanAssociationforComputerScienceLogic (EACSL), CSL 2005, was held at the University of Oxford on 22–25 August 2005. The conference series started as a program… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
2
Computer Science Logic - Luke Ong
Bestellen
bei Springer.com
€ 83,29
Bestellengesponserter Link

Luke Ong:

Computer Science Logic - neues Buch

ISBN: 9783540318972

Computer Science; Programming Languages, Compilers, Interpreters; Theory of Computation; Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Artificial Intelligence … Mehr…

  - Versandkosten:zzgl. Versandkosten.
3
Bestellen
bei hive.co.uk
£ 76,50
(ca. € 87,25)
Bestellengesponserter Link
Francesco di Castri:
Computer Science Logic : 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings - neues Buch

2005

ISBN: 9783540318972

; PDF; Computing > Computer programming / software development > Programming & scripting languages: general, Springer Berlin Heidelberg

  - No. 9783540318972. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
4
Computer Science Logic
Bestellen
bei eBook.de
€ 53,49
Bestellengesponserter Link
Computer Science Logic - neues Buch

2005, ISBN: 9783540318972

Computer Science Logic - 19th International Workshop CSL 2005 14th Annual Conference of the EACSL Oxford UK August 22-25 2005 Proceedings: ab 53.49 € eBooks > Fachthemen & Wissenschaft > … Mehr…

Versandkosten:in stock, , , zzgl. Versandkosten.
5
Bestellen
bei eBook.de
€ 87,99
Versand: € 0,001
Bestellengesponserter Link
Computer Science Logic - neues Buch

2005, ISBN: 9783540318972

Computer Science Logic ab 87.99 EURO 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings Medien > Bücher, [PU: Springer… Mehr…

  - Nr. Versandkosten:, , DE. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch

Detailangaben zum Buch - Computer Science Logic als eBook Download von


EAN (ISBN-13): 9783540318972
Erscheinungsjahr: 2005
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-04-19T00:54:15+02:00 (Vienna)
Detailseite zuletzt geändert am 2023-12-02T15:34:37+01:00 (Vienna)
ISBN/EAN: 9783540318972

ISBN - alternative Schreibweisen:
978-3-540-31897-2
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: logic computer science


Daten vom Verlag:

Autor/in: Luke Ong
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Computer Science Logic - 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings
Verlag: Springer; Springer Berlin
567 Seiten
Erscheinungsjahr: 2005-09-07
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XI, 567 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Constraint; ai logics; classical logic; complexity; computational logic; finite models; higher order logic; lambda calculus; linear logic; logic; logic programming; nonclassical logic; semantics; verifi; verification; C; Compilers and Interpreters; Theory of Computation; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Artificial Intelligence; Mathematical Logic and Foundations; Computer Science; Theoretische Informatik; Künstliche Intelligenz; Mathematik: Logik; Mathematische Grundlagen; BC

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.
Includes supplementary material: sn.pub/extras

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9783540749158 Computer Science Logic (Jacques Duparc; Thomas A. Henzinger)


< zum Archiv...