Skip to main content
SpringerLink
Log in

Flow-diagrams with sets

  • Conference paper
  • First Online:
COLOG-88 (COLOG 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 417))

Included in the following conference series:

Abstract

We investigate flow-chart programs equipped with sets to keep intermediate results of computations. It is shown that such programs form the weakly semi-universal class, i.e. are able to distinguish finite interpretations from infinite. It is not known whether this class is semi-universal, but if we in addition equip programs with level 2 sets, the resulting class is proved to be semi-universal, i.e. every generalized computable function in every infinite interpretation can be computed by some programs of the class. Some other properties of these two classes are proved.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tiuryn,J., An introduction to first-order dynamic logic. Research report, Washington State University, Pullman, 1984.

    Google Scholar 

  2. Harel, D., First-order dynamic logic, LNCS 68, Springer-Verlag, Berlin, 1979.

    Google Scholar 

  3. Urzyczyn,P., Logics of programs with boolean memory, Fundamenta Informaticae, 11, N 1 (1988).

    Google Scholar 

  4. Urzyczyn,P., Private communications, 1987.

    Google Scholar 

  5. Harel,D., and Peleg,D., On static logic, dynamic logic and complexity classes, Inform. Control, 60, 1984.

    Google Scholar 

  6. Kfoury, A.J.Pebble game and logics of programs. In "Harvey Friedman's Research on the Foundation of Mathematics", (L.A.Harrington et al., Eds.), Elsevier Science Publishers B.V. (North-Holland), 1985.

    Google Scholar 

  7. Kfoury,A.J., Stolboushkin,A.P., and Urzyczyn,P.Some open questions in the theory of program schemes and their logics, Uspekhi Matematicheskikh Nauk, 44, 1(265), 1989 (Russian).

    Google Scholar 

  8. Tiuryn,J., and Urzyczyn,P.Some relationships between logic of programs and complexity theory. In "IEEE Annu. Symp. Found. Comp. Sci.", 1983.

    Google Scholar 

  9. Stolboushkin, A.P., and Taitslin, M.A.Dynamic logics. In "Cybernetics and computer machinery" (V.A. Melnikov, Ed.), Nauka Science Publ., Moscow, 1986 (Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Program Systems Institute of the USSR Academy of Sciences, P.O. box ff, 152140, Pereslavl-Zalessky, Soviet Union

    Alexey P. Stolboushkin

Authors
  1. Alexey P. Stolboushkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Per Martin-Löf Grigori Mints

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stolboushkin, A.P. (1990). Flow-diagrams with sets. In: Martin-Löf, P., Mints, G. (eds) COLOG-88. COLOG 1988. Lecture Notes in Computer Science, vol 417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52335-9_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-52335-9_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52335-2

  • Online ISBN: 978-3-540-46963-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation