- 5 Ergebnisse
Kleinster Preis: € 85,60, größter Preis: € 125,15, Mittelwert: € 95,64
1
Logical Foundations of Computer Science - Springer
Bestellen
bei Buch.ch
CHF 133,50
(ca. € 125,15)
Bestellen
Details und Versand
gesponserter Link
Springer:

Logical Foundations of Computer Science - neues Buch

2007, ISBN: 9783540727347

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2007, held in New York, NY, USA in June 2007. The volume pre… Mehr…

  - No. 44257079 Versandkosten:zzgl. Versandkosten
zuklappen (X)
2
Logical Foundations of Computer Science : International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings - Dieter Jungnickel
Bestellen
bei hive.co.uk
£ 76,08
(ca. € 85,60)
Bestellen
Details und Versand
gesponserter Link

Dieter Jungnickel:

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

2007, ISBN: 9783540727347

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2007, held in New York, NY, USA in June 2007. The volume pre… Mehr…

No. 9783540727347. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
zuklappen (X)
3
Logical Foundations of Computer Science - Sergei Artemov; Anil Nerode
Bestellen
bei Springer.com
$ 109,00
(ca. € 90,49)
Versand: € 0,001
Bestellen
Details beim Anbieter
gesponserter Link
Sergei Artemov; Anil Nerode:
Logical Foundations of Computer Science - neues Buch

ISBN: 9783540727347

Computer Science; Theory of Computation; Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Mathematical Logic and Foundations Automat, automated deduction, complex… Mehr…

  - Versandkosten: EUR 0.00
zuklappen (X)
4
Logical Foundations of Computer Science als eBook Download von
Bestellen
bei Hugendubel.de
€ 88,49
Bestellen
Details und Versand
gesponserter Link
Logical Foundations of Computer Science als eBook Download von - neues Buch

2007, ISBN: 9783540727347

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

  - No. 25407486 Versandkosten:zzgl. Versandkosten
zuklappen (X)
5
Bestellen
bei eBook.de
€ 88,49
Bestellen
Details und Versand
gesponserter Link
Logical Foundations of Computer Science - neues Buch

2007, ISBN: 9783540727347

International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings eBooks > Fachthemen … Mehr…

  - No. 25407486 Versandkosten:zzgl. Versandkosten
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
Logical Foundations of Computer Science
Autor:
Titel:
ISBN-Nummer:

9783540727347

Detailangaben zum Buch - Logical Foundations of Computer Science


EAN (ISBN-13): 9783540727347
Erscheinungsjahr: 2007
Herausgeber: Sergei Artemov#Anil Nerode

Buch in der Datenbank seit 2016-05-24T17:26:41+02:00 (Vienna)
Detailseite zuletzt geändert am 2023-02-18T06:30:19+01:00 (Vienna)
ISBN/EAN: 9783540727347

ISBN - alternative Schreibweisen:
978-3-540-72734-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: dieter jungnickel
Titel des Buches: the logical must, foundations science

Daten vom Verlag:

Autor/in: Sergei Artemov; Anil Nerode
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Logical Foundations of Computer Science - International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings
Verlag: Springer; Springer Berlin
516 Seiten
Erscheinungsjahr: 2007-06-30
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XII, 516 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Automat; automated deduction; complexity; computer; computer science; database; distributed systems; game theory; interactive theorem proving; logic; programming; semantics; term rewriting; theorem proving; verification; C; Theory of Computation; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Mathematical Logic and Foundations; Computer Science; Mathematik: Logik; Mathematische Grundlagen; BC

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 PropositionalLogic.- 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.
< zum Archiv...