![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Logic at Botik 1989: Pereslav-Zalessky, USSR
- Albert R. Meyer, Michael A. Taitslin:
Logic at Botik '89, Symposium on Logical Foundations of Computer Science, Pereslav-Zalessky, USSR, July 3-8, 1989, Proceedings. Lecture Notes in Computer Science 363, Springer 1989, ISBN 3-540-51237-3 - Samson Abramsky
:
Observational Logic and Process Semantics (Abstract). 1 - Dmitry A. Archangelsky, Mikhail A. Taitslin:
A Logic for Data Description. 2-11 - David A. Basin:
Building Theories in Nuprl. 12-25 - Bard Bloom, Albert R. Meyer:
A Remark on Bisimulation Between Probabilistic Processes. 26-40 - José Carmo, Amílcar Sernadas:
Inevitability in Branching Time. 41-62 - Ludmila Cherkasova, Alexander S. Filurin:
Concurrent Processes with Synchronization: Net and Algebraic Approach. 63-80 - Edmund M. Clarke, Orna Grumberg, Robert P. Kurshan:
A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems. 81-90 - Dmitry O. Daderkin:
On A Class of Unoids. 91-100 - A. Ja. Dikovskii:
Space Considerations in Prolog. 101-107 - Yuri Gurevich, Saharon Shelah
:
Nearly Linear Time. 108-118 - Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones:
Experiments with Implementations of Two Theoretical Constructions. 119-133 - Maritta Heisel, Wolfgang Reif
, Werner Stephan:
A Dynamic Logic for Program Verification. 134-145 - Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
Discerning Causality in Interleaving Behavior. 146-162 - Hans Hüttel
, Kim Guldstrand Larsen
:
The Use of Static Constructs in A Modal Process Logic. 163-180 - Max I. Kanovich:
What is the Logic of Computational Tasks? 181-185 - A. J. Kfoury, Pawel Urzyczyn:
Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. 186-199 - Joachim Lambek:
Fixpoints Revisited. 200-207 - Yiannis N. Moschovakis:
A Mathematical Modeling of Pure, Recursive Algorithms. 208-229 - Vladimir Yu. Sazonov:
A Category of Many-Sorted Algebraic Theories Which is Equivalent to the Category of Categories with Finite Products. 230-244 - Grigori F. Shvarts:
Gentzen Style Systems for K45 and K45D. 245-256 - Dimiter Vakarelov:
Modal Logics for Knowledge Representation Systems. 257-277 - Wieslaw Zielonka:
Safe Executions of Recognizable Trace Languages by Asynchronous Automata. 278-289
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.