Produktbild: Pillars of Computer Science

Pillars of Computer Science Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday

Fr. 138.00

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

08.02.2008

Abbildungen

XXI, 683 p.

Herausgeber

Arnon Avron + weitere

Verlag

Springer Berlin

Seitenzahl

683

Maße (L/B/H)

23.5/15.5/3.8 cm

Gewicht

1060 g

Auflage

2008

Sprache

Englisch

ISBN

978-3-540-78126-4

Beschreibung

Rezension

From the reviews:



"This festschrift is dedicated to Boris Trakhtenbrot on the occasion of his 85
th
birthday. … The volume covers a wide variety of papers on logic and the foundations of theoretical computer science, written by top people in the field. It is certainly worth acquiring for a library." (K. Lodaya, ACM Computing Reviews, January, 2009)

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

08.02.2008

Abbildungen

XXI, 683 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

683

Maße (L/B/H)

23.5/15.5/3.8 cm

Gewicht

1060 g

Auflage

2008

Sprache

Englisch

ISBN

978-3-540-78126-4

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Pillars of Computer Science
  • From Logic to Theoretical Computer Science – An Update.- Reminiscences.- Boris A. Trakhtenbrot: Academic Genealogy and Publications.- Symmetric Logic of Proofs.- Synthesis of Monitors for Real-Time Analysis of Reactive Systems.- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms.- Effective Finite-Valued Approximations of General Propositional Logics.- Model Transformation Languages and Their Implementation by Bootstrapping Method.- Modal Fixed-Point Logic and Changing Models.- Fields, Meadows and Abstract Data Types.- Why Sets?.- The Church-Turing Thesis over Arbitrary Domains.- Generalized Categorial Dependency Grammars.- Temporal Verification of Probabilistic Multi-Agent Systems.- Linear Recurrence Relations for Graph Polynomials.- Artin’s Conjecture and Size of Finite Probabilistic Automata.- Introducing Reactive Kripke Semantics and Arc Accessibility.- On Partially Wellfounded Generic Ultrapowers.- Some Results on the Expressive Power and Complexity of LSCs.- Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories.- Tree Automata over Infinite Alphabets.- Connectives in Cumulative Logics.- Reasoning in Dynamic Logic about Program Termination.- The Grace of Quadratic Norms: Some Examples.- Nested Petri Nets for Adaptive Process Modeling.- Checking Temporal Properties of Discrete, Timed and Continuous Behaviors.- Token-Free Petri Nets.- Proof Search Tree and Cut Elimination.- Symbolic Verification Method for Definite Iterations over Tuples of Altered Data Structures and Its Application to Pointer Programs.- Categories of Elementary Sets over Algebras and Categories of Elementary Algebraic Knowledge.- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey.- The Scholten/DijkstraPebble Game Played Straightly, Distributedly, Online and Reversed.- The Reaction Algebra: A Formal Language for Event Correlation.- On Natural Non-dcpo Domains.- Church’s Problem and a Tour through Automata Theory.- From Monadic Logic to PSL.