Logic at Botik '89

1. Front Matter

   PDF

2. Observational logic and process semantics (abstract)

   • Samson Abramsky

   Pages 1-1

3. A logic for data description

   • D. A. Arhangelsky, M. A. Taitslin

   Pages 2-11

4. Building theories in Nuprl

   • David A. Basin

   Pages 12-25

5. A remark on bisimulation between probabilistic processes

   • Bard Bloom, Albert R. Meyer

   Pages 26-40

6. Inevitability in branching time

   • José Carmo, Amílcar Sernadas

   Pages 41-62

7. Concurrent processes with synchronization: Net and algebraic approach

   • Ludmila A. Cherkasova, Alexander S. Filurin

   Pages 63-80

8. A synthesis of two approaches for verifying finite state concurrent systems

   • E. M. Clarke, O. Grumberg, R. P. Kurshan

   Pages 81-90

9. On a class of unoids

   • Dmitry O. Daderkin

   Pages 91-100

10. Space considerations in Prolog

    • A.Ja. Dikovskii

    Pages 101-107

11. Nearly linear time

    • Yuri Gurevich, Saharon Shelah

    Pages 108-118

12. Experiments with implementations of two theoretical constructions

    • Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones

    Pages 119-133

13. A dynamic logic for program verification

    • M. Heisel, W. Reif, W. Stephan

    Pages 134-145

14. Discerning causality in interleaving behavior

    • J. Hirshfeld, A. Rabinovich, B. A. Trakhtenbrot

    Pages 146-162

15. The use of static constructs in a model process logic

    • Hans Hüttel, Kim G. Larsen

    Pages 163-180

16. What is the logic of computational tasks?

    • M. I. Kanovich

    Pages 181-185

17. Algol-like languages with higher-order procedures and their expressive power

    • A. J. Kfoury, P. Urzyczyn

    Pages 186-199

18. Fixpoints revisited

    • J. Lambek

    Pages 200-207

19. A mathematical modeling of pure, recursive algorithms

    • Yiannis. N. Moschovakis

    Pages 208-229

20. A category of many-sorted algebraic theories which is equivalent to the category of categories with finite products

    • V.Yu. Sazonov

    Pages 230-244

The present volume contains the proceedings of Logic at Botik '89, a symposium on logical foundations of computer science organized by the Program Systems Institute of the USSR Academy of Sciences and held at Pereslavl-Zalessky, USSR, July 3-8, 1989. The scope of the symposium was very broad; the topics of interest were: complexity of formal systems, constructive mathematics in computer science, denotational and operational semantics of programs, descriptive complexity, dynamic and algorithmic logics and schematology, formal tools to describe concurrent computations, lambda calculus and related topics, foundations of logic programming, logical foundations of database theory, logics for knowledge representation, modal and temporal logics, type theory in programming, and verification of programs. Thus, the papers in this volume represent many interesting trends in logical foundations of Computer Science, ranging from purely theoretical research to practical applications of theory.

• algorithm
• algorithms
• complexity
• knowledge representation
• lambda calculus
• logic
• programming
• semantics
• verification

Policies and ethics