Logic at Botik ’89: Symposium on Logical Foundations of Computer Science Pereslavl-Zalessky, USSR, July 3–8, 1989 Proceedings

Samson Abramsky (auth.), Albert R. Meyer, Michael A. Taitslin (eds.)3540512373, 9783540512370

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.

---

Table of contents :
Observational logic and process semantics (abstract)….Pages 1-1
A logic for data description….Pages 2-11
Building theories in Nuprl….Pages 12-25
A remark on bisimulation between probabilistic processes….Pages 26-40
Inevitability in branching time….Pages 41-62
Concurrent processes with synchronization: Net and algebraic approach….Pages 63-80
A synthesis of two approaches for verifying finite state concurrent systems….Pages 81-90
On a class of unoids….Pages 91-100
Space considerations in Prolog….Pages 101-107
Nearly linear time….Pages 108-118
Experiments with implementations of two theoretical constructions….Pages 119-133
A dynamic logic for program verification….Pages 134-145
Discerning causality in interleaving behavior….Pages 146-162
The use of static constructs in a model process logic….Pages 163-180
What is the logic of computational tasks?….Pages 181-185
Algol-like languages with higher-order procedures and their expressive power….Pages 186-199
Fixpoints revisited….Pages 200-207
A mathematical modeling of pure, recursive algorithms….Pages 208-229
A category of many-sorted algebraic theories which is equivalent to the category of categories with finite products….Pages 230-244
Gentzen style systems for K45 and K45D….Pages 245-256
Modal logics for knowledge representation systems….Pages 257-277
Safe executions of recognizable trace languages by asynchronous automata….Pages 278-289