Abstract is missing.
- From Logic to Theoretical Computer Science - An UpdateBoris A. Trakhtenbrot. 1-38 [doi]
- ReminiscencesAlbert R. Meyer. 39-45 [doi]
- Boris A. Trakhtenbrot: Academic Genealogy and PublicationsArnon Avron, Nachum Dershowitz, Alexander Rabinovich. 46-57 [doi]
- Symmetric Logic of ProofsSergei N. Artëmov. 58-71 [doi]
- Synthesis of Monitors for Real-Time Analysis of Reactive SystemsMikhail Auguston, Mark B. Trakhtenbrot. 72-86 [doi]
- A Framework for Formalizing Set Theories Based on the Use of Static Set TermsArnon Avron. 87-106 [doi]
- Effective Finite-Valued Approximations of General Propositional LogicsMatthias Baaz, Richard Zach. 107-129 [doi]
- Model Transformation Languages and Their Implementation by Bootstrapping MethodJanis Barzdins, Audris Kalnins, Edgars Rencis, Sergejs Rikacovs. 130-145 [doi]
- Modal Fixed-Point Logic and Changing ModelsJohan van Benthem, Daisuke Ikegami. 146-165 [doi]
- Fields, Meadows and Abstract Data TypesJan A. Bergstra, Yoram Hirshfeld, John Tucker. 166-178 [doi]
- Why Sets?Andreas Blass. 179-198 [doi]
- The Church-Turing Thesis over Arbitrary DomainsUdi Boker, Nachum Dershowitz. 199-229 [doi]
- Generalized Categorial Dependency GrammarsMichael I. Dekhtyar, Alexander Ja. Dikovsky. 230-255 [doi]
- Temporal Verification of Probabilistic Multi-Agent SystemsMichael I. Dekhtyar, Alexander Ja. Dikovsky, Mars K. Valiev. 256-265 [doi]
- Linear Recurrence Relations for Graph PolynomialsEldar Fischer, Johann A. Makowsky. 266-279 [doi]
- Artin s Conjecture and Size of Finite Probabilistic AutomataRusins Freivalds. 280-291 [doi]
- Introducing Reactive Kripke Semantics and Arc AccessibilityDov M. Gabbay. 292-341 [doi]
- On Partially Wellfounded Generic UltrapowersMoti Gitik, Menachem Magidor. 342-350 [doi]
- Some Results on the Expressive Power and Complexity of LSCsDavid Harel, Shahar Maoz, Itai Segall. 351-366 [doi]
- Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal CategoriesMasahito Hasegawa, Martin Hofmann, Gordon D. Plotkin. 367-385 [doi]
- Tree Automata over Infinite AlphabetsMichael Kaminski, Tony Tan. 386-423 [doi]
- Connectives in Cumulative LogicsDaniel Lehmann. 424-440 [doi]
- Reasoning in Dynamic Logic about Program TerminationDaniel Leivant. 441-456 [doi]
- The Grace of Quadratic Norms: Some ExamplesLeonid A. Levin. 457-459 [doi]
- Nested Petri Nets for Adaptive Process ModelingIrina A. Lomazova. 460-474 [doi]
- Checking Temporal Properties of Discrete, Timed and Continuous BehaviorsOded Maler, Dejan Nickovic, Amir Pnueli. 475-505 [doi]
- Token-Free Petri NetsAntoni Mazurkiewicz. 506-520 [doi]
- Proof Search Tree and Cut EliminationGrigori Mints. 521-536 [doi]
- Symbolic Verification Method for Definite Iterations over Tuples of Altered Data Structures and Its Application to Pointer ProgramsValery A. Nepomniaschy. 537-554 [doi]
- Categories of Elementary Sets over Algebras and Categories of Elementary Algebraic KnowledgeBoris I. Plotkin, Tatjana L. Plotkin. 555-570 [doi]
- Selection and Uniformization Problems in the Monadic Theory of Ordinals: A SurveyAlexander Rabinovich, Amit Shomrat. 571-588 [doi]
- The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and ReversedWolfgang Reisig. 589-595 [doi]
- The Reaction Algebra: A Formal Language for Event CorrelationCésar Sánchez, Matteo Slanina, Henny B. Sipma, Zohar Manna. 596-619 [doi]
- On Natural Non-dcpo DomainsVladimir Sazonov. 620-634 [doi]
- Church s Problem and a Tour through Automata TheoryWolfgang Thomas. 635-655 [doi]
- From Monadic Logic to PSLMoshe Y. Vardi. 656-681 [doi]