Logic at Botik '89 : Symposium on logical foundations of computer science, Pereslavl-Zalessky, USSR, July 3-8, 1989 : proceedings
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; t...
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
363 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic at Botik '89, proceedings, Symposium on logical foundations of computer science, Pereslavl-Zalessky, USSR, July 3-8, 1989, Berlin, Springer-Verlag, 1989, 1 vol. (X-289 p.), Lecture notes in computer science, 3-540-51237-3 • Logic at Botik '89, Texte imprimé, 9783662189191 |
Sommario:
- 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.