Atlas home || Conferences | Abstracts | about Atlas

21st Days of Weak Arithmetics
June 7-9, 2002
Steklov Institute of Mathematics
St. Petersburg, Russia

Organizers
Paola d'Aquino (Italy), Anatoly Beltiukov (Russia), Patrick Cegielski (France), Gregory Kucherov (France), Krzysztof Lorys (Poland), Yuri Matiyassevich (Russia), the chairman, Jean-Pierre Ressayre (France), Denis Richard (France), Maxim Vsemirov (Russia)

View Abstracts
Conference Homepage

Logically Definable Languages of Computations in one Class of Flow Event Structures
by
K.V. Shahbazyan
Institute for Informatics and Automation Problems, National Academy of Sciences of Armenia
Coauthors: Yu.H. Shoukourian

We consider languages of computations in one class of models of distributed computations - infinite homogenous flow event structures - and their representability in logical languages.

The languages of infinite configurations are representable in monadic second-order logic.

The languages of proving sequences are representable in Presburger logic complemented with a finite set of monadic predicates.

Date received: April 16, 2002

Copyright © 2002 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cail-18.