## Logic at Botik '89: Symposium on Logical Foundations of Computer Science, Pereslavl-Zalessky, USSR, July 3-8, 1989, ProceedingsAlbert R. Meyer, Michael A. Taitslin 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Observational Logic and Process Semantics abstract | 1 |

A LOGIC FOR DATA DESCRIPTION | 2 |

Building Theories In Nuprl | 12 |

A Remark on Bisimulation between Probabilistic Processes | 26 |

Inevitability in Branching Time | 41 |

CONCURRENT PROCESSES WITH SYNCHRONIZATION NET AND ALGEBRAIC APPROACH | 63 |

A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems | 81 |

ON A CLASS OF UNOIDS | 91 |

Discerning Causality in Interleaving Behavior | 146 |

The Use of Static Constructs in A Modal Process Logic | 163 |

WHAT IS THE LOGIC OF COMPUTATIONAL TASKS ? | 181 |

ALGOLLIKE LANGUAGES WITH HIGHERORDER PROCEDURES AND THEIR EXPRESSIVE POWER | 186 |

Fixpoints revisited | 200 |

A mathematical modeling of pure recursive algorithms | 208 |

A CATEGORY OF MANYSORTED ALGEBRAIC THEORIES WHICH IS EQUIVALENT TO THE CATEGORY OF CATEGORIES WITH FINITE ... | 230 |

GENTZEN STYLE SYSTEMS FOR K45 AND K45D | 245 |

SPACE CONSIDERATIONS IN PROLOG | 101 |

Nearly Linear Time | 108 |

Experiments with Implementations of two Theoretical Constructions | 119 |

A DYNAMIC LOGIC FOR PROGRAM VERIFICATION | 134 |

MODAL LOGICS FOR KNOWLEDGE REPRESENTATION SYSTEMS | 257 |

SAFE EXECUTIONS OF RECOGNIZABLE TRACE LANGUAGES BY ASYNCHRONOUS AUTOMATA | 278 |

### Other editions - View all

Logic at Botik '89: Symposium on Logical Foundations of Computer Science ... Albert R. Meyer,Michael A. Taitslin No preview available - 2014 |

### Common terms and phrases

2DPDA actions algebras algorithm arrows assigned asynchronous cellular automaton atomic automata automaton axiomatization axioms basic behaviour bisimilar bisimulation boolean branching called cartesian closed category causal semantics complete Computer Science concurrent processes consider consistent construct contains corresponding defined definition denote deterministic equations equivalent example exists finite set fixed-point fixpoint function functor given goto graph hence implementation induction hypothesis inference rules infinite input KR-structure KR-system Kripke structure Lemma linear logic mathematical modal model checking Muller automaton multiautomaton nonlocal notion Nuprl obtain operational semantics operator OS-net pair Petri Nets polynomial pomset processes predicate probabilistic processes problem procedure programming language prolog proof properties Proposition prove Ramsey's theorem recursor relation result satisfied sequence set of formulas simulated specification subset Suppose symbols tape temporal logic term theory transition tree true Turing machines unoid uſe variables verification