Atjaunināt sīkdatņu piekrišanu

Fields of Logic and Computation II: Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday 1st ed. 2015 [Mīkstie vāki]

Edited by , Edited by , Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 319 pages, height x width: 235x155 mm, weight: 5037 g, 15 Illustrations, black and white; X, 319 p. 15 illus., 1 Paperback / softback
  • Sērija : Programming and Software Engineering 9300
  • Izdošanas datums: 27-Aug-2015
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319235338
  • ISBN-13: 9783319235332
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 319 pages, height x width: 235x155 mm, weight: 5037 g, 15 Illustrations, black and white; X, 319 p. 15 illus., 1 Paperback / softback
  • Sērija : Programming and Software Engineering 9300
  • Izdošanas datums: 27-Aug-2015
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319235338
  • ISBN-13: 9783319235332
This Festschrift is published in honor of Yuri Gurevich's 75th birthday. Yuri Gurevich has made fundamental contributions on the broad spectrum of logic and computer science, including decision procedures, the monadic theory of order, abstract state machines, formal methods, foundations of computer science, security, and much more. Many of these areas are reflected in the 20 articles in this Festschrift and in the presentations at the "Yurifest" symposium, which was held in Berlin, Germany, on September 11 and 12, 2015. The Yurifest symposium was co-located with the 25th Annual Conference on Computer Science Logic (CSL 2015).
K-trivial, K-low and MLR-low Sequences: A Tutorial
1(23)
Laurent Bienvenu
Alexander Shen
Horn Clause Solvers for Program Verification
24(28)
Nikolaj Bjorner
Arie Gurfinkel
Ken McMillan
Andrey Rybalchenko
Existential Fixed-Point Logic as a Fragment of Second-Order Logic
52(17)
Andreas Blass
On the Unpredictability of Individual Quantum Measurement Outcomes
69(18)
Alastair A. Abbott
Cristian S. Calude
Karl Svozil
The Ehrenfeucht-Fraisse Method and the Planted Clique Conjecture
87(22)
Yijia Chen
Jorg Flum
Monadic Theory of a Linear Order Versus the Theory of Its Subsets with the Lifted Min/Max Operations
109(20)
Christian Choffrut
Serge Grigorieff
Regularity Equals Monadic Second-Order Definability for Quasi-trees
129(13)
Bruno Courcelle
Capturing MSO with One Quantifier
142(11)
Anuj Dawar
Luc Segoufin
Logics for Weighted Timed Pushdown Automata
153(21)
Manfred Droste
Vitaly Perevoshchikov
Inherent Vacuity in Lattice Automata
174(19)
Hila Gonen
Orna Kupferman
Is Polynomial Time Choiceless?
193(17)
Erich Gradel
Martin Grohe
Arithmetical Congruence Preservation: From Finite to Infinite
210(16)
Patrick Cegielski
Serge Grigorieff
Irene Guessarian
An Extension of the Ehrenfeucht-Fraisse Game for First Order Logics Augmented with Lindstrom Quantifiers
226(11)
Simi Haber
Saharon Shelah
Logics of Finite Hankel Rank
237(16)
Nadia Labai
Johann A. Makowsky
The Strategy of Campaigning
253(8)
Rohit Parikh
Cagil Tasdemir
On Almost Future Temporal Logics
261(12)
Alexander Rabinovich
Minsky Machines and Algorithmic Problems
273(20)
Mark Sapir
On Failure of 0-1 Laws
293(4)
Saharon Shelah
Composition over the Natural Number Ordering with an Extra Binary Relation
297(10)
Wolfgang Thomas
The Fundamental Nature of the Log Loss Function
307(12)
Vladimir Vovk
Author Index 319