Pillars of Computer Science
Editat de Arnon Avron, Nachum Dershowitz, Alexander Rabinovichen Limba Engleză Paperback – 8 feb 2008
Preț: 642.98 lei
Preț vechi: 803.73 lei
-20% Nou
Puncte Express: 964
Preț estimativ în valută:
113.76€ • 132.73$ • 99.46£
113.76€ • 132.73$ • 99.46£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540781264
ISBN-10: 3540781269
Pagini: 712
Ilustrații: XXI, 683 p.
Dimensiuni: 155 x 235 x 38 mm
Greutate: 1.06 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540781269
Pagini: 712
Ilustrații: XXI, 683 p.
Dimensiuni: 155 x 235 x 38 mm
Greutate: 1.06 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Recenzii
From the reviews:
"This festschrift is dedicated to Boris Trakhtenbrot on the occasion of his 85th 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)
"This festschrift is dedicated to Boris Trakhtenbrot on the occasion of his 85th 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)