Logic at Botik '89: Symposium on Logical Foundations of Computer Science, Pereslavl-Zalessky, USSR, July 3-8, 1989, Proceedings / Edition 1 available in Paperback
- Pub. Date:
- Springer Berlin Heidelberg
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).- A logic for data description.- Building theories in Nuprl.- A remark on bisimulation between probabilistic processes.- Inevitability in branching time.- Concurrent processes with synchronization: Net and algebraic approach.- A synthesis of two approaches for verifying finite state concurrent systems.- On a class of unoids.- Space considerations in Prolog.- Nearly linear time.- Experiments with implementations of two theoretical constructions.- A dynamic logic for program verification.- Discerning causality in interleaving behavior.- The use of static constructs in a model process logic.- What is the logic of computational tasks?.- Algol-like languages with higher-order procedures and their expressive power.- Fixpoints revisited.- A mathematical modeling of pure, recursive algorithms.- A category of many-sorted algebraic theories which is equivalent to the category of categories with finite products.- Gentzen style systems for K45 and K45D.- Modal logics for knowledge representation systems.- Safe executions of recognizable trace languages by asynchronous automata.