Logic at Botik '89 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540512370, 9783540461807

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A dynamic logic for program verification

Logic at Botik '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-51237-3_12 ◽

1989 ◽

pp. 134-145 ◽

Cited By ~ 15

Author(s):

M. Heisel ◽

W. Reif ◽

W. Stephan

Keyword(s):

Program Verification ◽

Dynamic Logic

Download Full-text

A remark on bisimulation between probabilistic processes

Logic at Botik '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-51237-3_4 ◽

1989 ◽

pp. 26-40 ◽

Cited By ~ 10

Author(s):

Bard Bloom ◽

Albert R. Meyer

Keyword(s):

Probabilistic Processes

Download Full-text

Safe executions of recognizable trace languages by asynchronous automata

Logic at Botik '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-51237-3_22 ◽

1989 ◽

pp. 278-289 ◽

Cited By ~ 20

Author(s):

Wiesław Zielonka

Keyword(s):

Asynchronous Automata

Download Full-text

A logic for data description

Logic at Botik '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-51237-3_2 ◽

1989 ◽

pp. 2-11 ◽

Cited By ~ 2

Author(s):

D. A. Arhangelsky ◽

M. A. Taitslin

Keyword(s):

Data Description

Download Full-text

A category of many-sorted algebraic theories which is equivalent to the category of categories with finite products

Logic at Botik '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-51237-3_19 ◽

1989 ◽

pp. 230-244

Author(s):

V.Yu. Sazonov

Keyword(s):

Algebraic Theories ◽

Finite Products

Download Full-text

Algol-like languages with higher-order procedures and their expressive power

Logic at Botik '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-51237-3_16 ◽

1989 ◽

pp. 186-199 ◽

Cited By ~ 2

Author(s):

A. J. Kfoury ◽

P. Urzyczyn

Keyword(s):

Expressive Power ◽

Higher Order

Download Full-text

A mathematical modeling of pure, recursive algorithms

Logic at Botik '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-51237-3_18 ◽

1989 ◽

pp. 208-229 ◽

Cited By ~ 4

Author(s):

Yiannis. N. Moschovakis

Keyword(s):

Mathematical Modeling ◽

Recursive Algorithms

Download Full-text

Nearly linear time

Logic at Botik '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-51237-3_10 ◽

1989 ◽

pp. 108-118 ◽

Cited By ~ 35

Author(s):

Yuri Gurevich ◽

Saharon Shelah

Keyword(s):

Linear Time

Download Full-text

On a class of unoids

Logic at Botik '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-51237-3_8 ◽

1989 ◽

pp. 91-100

Author(s):

Dmitry O. Daderkin

Download Full-text

Building theories in Nuprl

Logic at Botik '89 - Lecture Notes in Computer Science ◽

10.1007/3-540-51237-3_3 ◽

1989 ◽

pp. 12-25 ◽

Cited By ~ 2

Author(s):

David A. Basin

Download Full-text

Logic at Botik '89 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A dynamic logic for program verification

A remark on bisimulation between probabilistic processes

Safe executions of recognizable trace languages by asynchronous automata

A logic for data description

A category of many-sorted algebraic theories which is equivalent to the category of categories with finite products

Algol-like languages with higher-order procedures and their expressive power

A mathematical modeling of pure, recursive algorithms

Nearly linear time

On a class of unoids

Building theories in Nuprl

Logic at Botik '89 - Lecture Notes in Computer Science
Latest Publications