85. Birthday: Boris A. Trakhtenbrot, 2006 / 2008

• Boris A. Trakhtenbrot:
  From Logic to Theoretical Computer Science - An Update. 1-38
  
• Albert R. Meyer:
  Reminiscences. 39-45
  
• Arnon Avron, Nachum Dershowitz, Alexander Rabinovich:
  Boris A. Trakhtenbrot: Academic Genealogy and Publications. 46-57
  
• Sergei N. Artëmov:
  Symmetric Logic of Proofs. 58-71
  
• Mikhail Auguston, Mark B. Trakhtenbrot:
  Synthesis of Monitors for Real-Time Analysis of Reactive Systems. 72-86
  
• Arnon Avron:
  A Framework for Formalizing Set Theories Based on the Use of Static Set Terms. 87-106
  
• Matthias Baaz, Richard Zach:
  Effective Finite-Valued Approximations of General Propositional Logics. 107-129
  
• Janis Barzdins, Audris Kalnins, Edgars Rencis, Sergejs Rikacovs:
  Model Transformation Languages and Their Implementation by Bootstrapping Method. 130-145
  
• Johan van Benthem, Daisuke Ikegami:
  Modal Fixed-Point Logic and Changing Models. 146-165
  
• Jan A. Bergstra, Yoram Hirshfeld, John Tucker:
  Fields, Meadows and Abstract Data Types. 166-178
  
• Andreas Blass:
  Why Sets? 179-198
  
• Udi Boker, Nachum Dershowitz:
  The Church-Turing Thesis over Arbitrary Domains. 199-229
  
• Michael I. Dekhtyar, Alexander Ja. Dikovsky:
  Generalized Categorial Dependency Grammars. 230-255
  
• Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev:
  Temporal Verification of Probabilistic Multi-Agent Systems. 256-265
  
• Eldar Fischer, Johann A. Makowsky:
  Linear Recurrence Relations for Graph Polynomials. 266-279
  
• Rusins Freivalds:
  Artin's Conjecture and Size of Finite Probabilistic Automata. 280-291
  
• Dov M. Gabbay:
  Introducing Reactive Kripke Semantics and Arc Accessibility. 292-341
  
• Moti Gitik, Menachem Magidor:
  On Partially Wellfounded Generic Ultrapowers. 342-350
  
• David Harel, Shahar Maoz, Itai Segall:
  Some Results on the Expressive Power and Complexity of LSCs. 351-366
  
• Masahito Hasegawa, Martin Hofmann, Gordon D. Plotkin:
  Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories. 367-385
  
• Michael Kaminski, Tony Tan:
  Tree Automata over Infinite Alphabets. 386-423
  
• Daniel Lehmann:
  Connectives in Cumulative Logics. 424-440
  
• Daniel Leivant:
  Reasoning in Dynamic Logic about Program Termination. 441-456
  
• Leonid A. Levin:
  The Grace of Quadratic Norms: Some Examples. 457-459
  
• Irina A. Lomazova:
  Nested Petri Nets for Adaptive Process Modeling. 460-474
  
• Oded Maler, Dejan Nickovic, Amir Pnueli:
  Checking Temporal Properties of Discrete, Timed and Continuous Behaviors. 475-505
  
• Antoni Mazurkiewicz:
  Token-Free Petri Nets. 506-520
  
• Grigori Mints:
  Proof Search Tree and Cut Elimination. 521-536
  
• Valery A. Nepomniaschy:
  Symbolic Verification Method for Definite Iterations over Tuples of Altered Data Structures and Its Application to Pointer Programs. 537-554
  
• Boris I. Plotkin, Tatjana L. Plotkin:
  Categories of Elementary Sets over Algebras and Categories of Elementary Algebraic Knowledge. 555-570
  
• Alexander Rabinovich, Amit Shomrat:
  Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey. 571-588
  
• Wolfgang Reisig:
  The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed. 589-595
  
• César Sánchez, Matteo Slanina, Henny B. Sipma, Zohar Manna:
  The Reaction Algebra: A Formal Language for Event Correlation. 596-619
  
• Vladimir Sazonov:
  On Natural Non-dcpo Domains. 620-634
  
• Wolfgang Thomas:
  Church's Problem and a Tour through Automata Theory. 635-655
  
• Moshe Y. Vardi:
  From Monadic Logic to PSL. 656-681