- 5 Ergebnisse
Kleinster Preis: € 106,72, größter Preis: € 126,31, Mittelwert: € 112,97
1
Computer Science Logic : 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings - Laurent Fribourg
Bestellen
bei ZVAB.com
€ 106,72
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Laurent Fribourg:

Computer Science Logic : 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings - Taschenbuch

2001, ISBN: 3540425543

[EAN: 9783540425540], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], INFORMATIK; INTELLIGENZ / KÜNSTLICHE INTELLIGENZ; KI; - AI; LOGIK; PHILOSOPHIE AUTOMAT; AUTOMATA; COMPLEXITY; L… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
zuklappen (X)
2
Computer Science Logic by Laurent Fribourg Paperback | Indigo Chapters
Bestellen
bei Indigo.ca
C$ 180,95
(ca. € 126,31)
Bestellen
Details und Versand
gesponserter Link
Computer Science Logic by Laurent Fribourg Paperback | Indigo Chapters - neues Buch

2001, ISBN: 9783540425540

The Annual Conference of the European Association for Computer Science Logic, CSL 2001, was held in Paris, Palais de la Mutualit´ e, on September 10-13, 2001. This was the 15th in a seri… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
zuklappen (X)
3
Computer Science Logic
Bestellen
bei Hugendubel.de
€ 112,49
Versand: € 3,951
Bestellen
Details beim Anbieter
gesponserter Link
Computer Science Logic - Taschenbuch

2001

ISBN: 3540425543

Computer Science Logic ab 112.49 € als Taschenbuch: 15th International Workshop CSL 2001. 10th Annual Conference of the EACSL Paris France September 10-13 2001 Proceedings. Auflage 2001. … Mehr…

Nr. 7140699. Versandkosten:, , zzgl. Versandkosten. (EUR 3.95)
zuklappen (X)
4
Computer Science Logic - Laurent Fribourg
Bestellen
bei lehmanns.de
€ 112,34
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Laurent Fribourg:
Computer Science Logic - Taschenbuch

2001, ISBN: 9783540425540

15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings, Buch, Softcover, [PU: Springer Berlin], Springer Berlin, 2001

Versandkosten:Versand in 10-14 Tagen. (EUR 0.00)
zuklappen (X)
5
Computer Science Logic
Bestellen
bei Springer.com
€ 106,99
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Computer Science Logic - neues Buch

ISBN: 9783540425540

There is currently no description available, Springer

Nr. 978-3-540-42554-0. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
zuklappen (X)
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
Computer Science Logic by Laurent Fribourg Paperback | Indigo Chapters
Autor:
Titel:
ISBN-Nummer:

9783540425540


This book constitutes the refereed proceedings of the 15th International Workshop on Computer Science Logic, CSL 2001, held as the 10th Annual Conerence of the EACSL in Paris, France in September 2001.The 39 revised full papers presented together with two invited papers were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on linear logic, descriptive complexity, semantics, higher-order programs, model logics, verification, automata, lambda calculus, induction, equational calculus, and constructive theory of types.

Detailangaben zum Buch - Computer Science Logic by Laurent Fribourg Paperback | Indigo Chapters


EAN (ISBN-13): 9783540425540
ISBN (ISBN-10): 3540425543
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2001
Herausgeber: Laurent Fribourg
636 Seiten
Gewicht: 0,947 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-20T06:29:18+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-03-25T11:31:34+01:00 (Vienna)
ISBN/EAN: 9783540425540

ISBN - alternative Schreibweisen:
3-540-42554-3, 978-3-540-42554-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: fribourg, laurent, fleury, the international association, poster, jean yves girard
Titel des Buches: logic computer science, lecture notes computer science, france, paris

Daten vom Verlag:

Autor/in: Laurent Fribourg
Titel: Lecture Notes in Computer Science; Computer Science Logic - 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001 Proceedings
Verlag: Springer; Springer Berlin
628 Seiten
Erscheinungsjahr: 2001-08-29
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XII, 628 p.

BC; Hardcover, Softcover / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Automat; automata; complexity; lambda calculus; logic; semantics; verification; Compilers and Interpreters; Artificial Intelligence; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Mathematical Logic and Foundations; Künstliche Intelligenz; Theoretische Informatik; Mathematik: Logik; Mathematische Grundlagen; EA

Invited Papers.- Local Reasoning about Programs that Alter Data Structures.- Applications of Alfred Tarski’s Ideas in Database Theory.- Locus Solum: From the Rules of Logic to the Logic of Rules.- Contributed Papers.- The Expressive Power of Horn Monadic Linear Logic.- Non-commutativity and MELL in the Calculus of Structures.- Quadratic Correctness Criterion for Non-commutative Logic.- Descriptive Complexity.- Capture Complexity by Partition.- An Existential Locality Theorem.- Actual Arithmetic and Feasibility.- The Natural Order-Generic Collapse for ?-Representable Databases over the Rational and the Real Ordered Group.- Semantics.- An Algebraic Foundation for Higraphs.- Semantic Characterisations of Second-Order Computability over the Real Numbers.- An Abstract Look at Realizability.- The Anatomy of Innocence.- Higher-Order Programs.- An Improved Extensionality Criterion for Higher-Order Logic Programs.- A Logic for Abstract State Machines.- Constrained Hyper Tableaux.- Modal Logics.- Modal Logic and the Two-Variable Fragment.- A Logic for Approximate First-Order Reasoning.- Inflationary Fixed Points in Modal Logic.- Categorical and Kripke Semantics for Constructive S4 Modal Logic.- Verification.- Labelled Natural Deduction for Interval Logics.- Decidable Navigation Logics for Object Structures.- The Decidability of Model Checking Mobile Ambients.- Automata.- A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem.- An Effective Extension of the Wagner Hierarchy to Blind Counter Automata.- Decision Procedure for an Extension of WS1S.- Lambda-Calculus.- Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic.- Intersection Logic.- Life without the Terminal Type.- Fully Complete Minimal PER Models for the Simply Typed?-Calculus.- Induction.- A Principle of Induction.- On a Generalisation of Herbrand’s Theorem.- Well-Founded Recursive Relations.- Equational Calculus.- Stratified Context Unification Is in PSPACE.- Uniform Derivation of Decision Procedures by Superposition.- Complete Categorical Equational Deduction.- Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.- Constructive Theory of Types.- Normalized Types.- Markov’s Principle for Propositional Type Theory.- Recursion for Higher-Order Encodings.- Monotone Inductive and Coinductive Constructors of Rank 2.
Includes supplementary material: sn.pub/extras
< zum Archiv...