Abstract is missing.
- Observational Logic and Process Semantics (Abstract)Samson Abramsky. 1
- A Logic for Data DescriptionDmitry A. Archangelsky, Mikhail A. Taitslin. 2-11
- Building Theories in NuprlDavid A. Basin. 12-25
- A Remark on Bisimulation Between Probabilistic ProcessesBard Bloom, Albert R. Meyer. 26-40
- Inevitability in Branching TimeJosé Carmo, Amílcar Sernadas. 41-62
- Concurrent Processes with Synchronization: Net and Algebraic ApproachLudmila Cherkasova, Alexander S. Filurin. 63-80
- A Synthesis of Two Approaches for Verifying Finite State Concurrent SystemsEdmund M. Clarke, Orna Grumberg, Robert P. Kurshan. 81-90
- On A Class of UnoidsDmitry O. Daderkin. 91-100
- Space Considerations in PrologA. Ja. Dikovskii. 101-107
- Nearly Linear TimeYuri Gurevich, Saharon Shelah. 108-118
- Experiments with Implementations of Two Theoretical ConstructionsTorben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones. 119-133
- A Dynamic Logic for Program VerificationMaritta Heisel, Wolfgang Reif, Werner Stephan. 134-145
- Discerning Causality in Interleaving BehaviorYoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot. 146-162
- The Use of Static Constructs in A Modal Process LogicHans Hüttel, Kim Guldstrand Larsen. 163-180
- What is the Logic of Computational Tasks?Max I. Kanovich. 181-185
- Algo-Like Languages with Higher-Order Procedures and Their Expressive PowerA. J. Kfoury, Pawel Urzyczyn. 186-199
- Fixpoints RevisitedJoachim Lambek. 200-207
- A Mathematical Modeling of Pure, Recursive AlgorithmsYiannis N. Moschovakis. 208-229
- A Category of Many-Sorted Algebraic Theories Which is Equivalent to the Category of Categories with Finite ProductsVladimir Yu. Sazonov. 230-244
- Gentzen Style Systems for K45 and K45DGrigori F. Shvarts. 245-256
- Modal Logics for Knowledge Representation SystemsDimiter Vakarelov. 257-277
- Safe Executions of Recognizable Trace Languages by Asynchronous AutomataWieslaw Zielonka. 278-289